Routing with Improved Communication-Space Trade-Off
From MaRDI portal
Publication:5464200
DOI10.1007/978-3-540-30186-8_22zbMath1110.68329OpenAlexW1602024640MaRDI QIDQ5464200
Cyril Gavoille, Ittai Abraham, Dahlia Malkhi
Publication date: 17 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-30186-8_22
Related Items (8)
Name-independent compact routing in trees ⋮ Strong-diameter decompositions of minor free graphs ⋮ Distance estimation and object location via rings of neighbors ⋮ On efficient distributed construction of near optimal routing schemes ⋮ Compact roundtrip routing with topology-independent node names ⋮ Max-stretch reduction for tree spanners ⋮ A note on models for graph representations ⋮ Subexponential parameterized algorithms for graphs of polynomial growth
This page was built for publication: Routing with Improved Communication-Space Trade-Off
