Quick Detection of Nodes with Large Degrees

DOI10.1007/978-3-642-30541-2_5zbMath1342.05175arXiv1202.3261OpenAlexW1785454933MaRDI QIDQ2900585

Marina Sokol, Nelly Litvak, Don Towsley, Konstantin E. Avrachenkov

Publication date: 23 July 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.3261

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Network protocols (68M12) Vertex degrees (05C07)

Related Items (2)

Fast Low-Cost Estimation of Network Properties Using Random Walks ⋮ I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs

This page was built for publication: Quick Detection of Nodes with Large Degrees