58 citations · 64 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012★ 6 cited
Quick Detection of Nodes with Large Degrees
Konstantin Avrachenkov, Nelly Litvak, Marina Sokol +1
Our goal is to quickly find top lists of nodes with the largest degrees in large complex networks. If the adjacency list of the network is known (not often the case in complex…
cs.DS2010★ 58 cited
Estimating and Sampling Graphs with Multidimensional Random Walks
Bruno Ribeiro, Don Towsley
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random wa…