A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence

DOI10.1080/15427951.2013.819210MaRDI QIDQ4985352zbMATH OpenOpenAlexWikidataFDO

Authors Colin Cooper, Tomasz Radzik, Yiannis Siantos

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

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

Recommendations

• A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
• Random Walks with Lookahead on Power Law Random Graphs
• Quick detection of nodes with large degrees
• Large cliques in a power-law random graph
• Quick detection of nodes with large degrees

Cites work

• scientific article; zbMATH DE number 2038774 (Why is no real title available?)
• scientific article; zbMATH DE number 878897 (Why is no real title available?)
• A general model of web graphs
• Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
• Coalescing random walks and voting on graphs
• Distribution of Vertex Degree in Web-Graphs
• Emergence of Scaling in Random Networks
• On the bias of traceroute sampling
• The cover time of the preferential attachment graph
• The degree sequence of a scale-free random graph process
• The diameter of a scale-free random graph

Cited in

(4)

• A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
• Random Walks with Lookahead on Power Law Random Graphs
• Quick detection of nodes with large degrees
• Quick detection of nodes with large degrees

This page was built for publication: A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985352)