6 citations · 6 across the 1 of their papers we have counts for
1 paper
Konstantin Avrachenkov, Nelly Litvak, Marina Sokol +1
Our goal is to quickly find top k 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…