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

DOI10.1080/15427951.2013.819210zbMath1461.05206OpenAlexW2594736226WikidataQ115004074 ScholiaQ115004074MaRDI QIDQ4985352

Yiannis Siantos, Colin Cooper, Tomasz Radzik

Publication date: 23 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2013.819210

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)

Cites Work

• Unnamed Item
• Unnamed Item
• The cover time of the preferential attachment graph
• The diameter of a scale-free random graph
• The degree sequence of a scale-free random graph process
• Coalescing random walks and voting on graphs
• Emergence of Scaling in Random Networks
• Distribution of Vertex Degree in Web-Graphs
• A general model of web graphs
• Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
• On the bias of traceroute sampling

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