Non-searchability of random scale-free graphs

DOI10.1145/1281100.1281183MaRDI QIDQ5401475zbMATH OpenOpenAlexFDO

Authors Philippe Duchon, Nicole Eggemann, Nicolas Hanusse

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00176940/file/09-algotel2007final-hanusse.pdf

zbMATH Keywords

distributed algorithmsroutingscale-free graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Deterministic Decentralized Search in Random Graphs
• Deterministic Decentralized Search in Random Graphs
• Concentration of vertex degrees in a scale‐free random graph process
• Analyzing the cliques in scale-free random graphs
• Local degree distribution in scale free random graphs

Cited in

(4)

• Searching efficiency on complex networks under visual range of nodes
• Scalable percolation search on complex networks
• Deterministic Decentralized Search in Random Graphs
• Deterministic Decentralized Search in Random Graphs

This page was built for publication: Non-searchability of random scale-free graphs

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