Non-searchability of random scale-free graphs
From MaRDI portal
Publication:5401475
DOI10.1145/1281100.1281183zbMath1283.68395OpenAlexW2107218428MaRDI QIDQ5401475
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
This page was built for publication: Non-searchability of random scale-free graphs