A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence

DOI10.1007/978-3-642-30541-2_13zbMath1342.05183OpenAlexW3029186527MaRDI QIDQ2900595

Yiannis Siantos, Colin Cooper, Tomasz Radzik

Publication date: 23 July 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-30541-2_13

zbMATH Keywords

biassed random walk

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07) Internet topics (68M11)

Related Items (2)

Sampling social networks using shortest paths ⋮ Ultra-Fast Load Balancing on Scale-Free Networks

This page was built for publication: A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence