Space-efficiency for routing schemes of stretch factor three

DOI10.1006/JPDC.2000.1705zbMath0990.68014OpenAlexW2133065816MaRDI QIDQ5943110

Marc Gengler, Cyril Gavoille

Publication date: 14 August 2002

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/756a0230c7475053258dddf8a6de992d9ca565c5

zbMATH Keywords

routing algorithms

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (11)

Average stretch analysis of compact routing schemes ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ Distributed computing of efficient routing schemes in generalized chordal graphs ⋮ Distance estimation and object location via rings of neighbors ⋮ Compact and localized distributed data structures ⋮ Fault-Tolerant Compact Routing Schemes for General Graphs ⋮ Compact roundtrip routing with topology-independent node names ⋮ The idemetric property: when most distances are (almost) the same ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ On compact and efficient routing in certain graph classes ⋮ Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs

This page was built for publication: Space-efficiency for routing schemes of stretch factor three