Compact Routing in Power-Law Graphs

DOI10.1007/978-3-642-04355-0_41zbMath1261.68019OpenAlexW1527483699MaRDI QIDQ3646238

Wei Chen, Yajun Wang, Christian Sommer, Shang-Hua Teng

Publication date: 19 November 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-04355-0_41

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (4)

Approximate distance oracles with improved stretch for sparse graphs ⋮ \(k\)-chordal graphs: from cops and robber to compact routing via treewidth ⋮ Preprocess, set, query! ⋮ Approximate distance oracles with improved stretch for sparse graphs

This page was built for publication: Compact Routing in Power-Law Graphs