Algorithms – ESA 2005

DOI10.1007/11561071zbMath1142.68457OpenAlexW2501059503MaRDI QIDQ5475887

Pierre Fraigniaud

Publication date: 27 June 2006

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

Full work available at URL: https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Distributed computing of efficient routing schemes in generalized chordal graphs ⋮ Distance estimation and object location via rings of neighbors ⋮ Asymptotically optimal solutions for small world graphs ⋮ Depth of Field and Cautious-Greedy Routing in Social Networks ⋮ Recovering the long-range links in augmented graphs ⋮ Greedy routing in small-world networks with power-law degrees ⋮ Universal augmentation schemes for network navigability ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Navigable small-world networks with few random bits ⋮ Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs