Compact roundtrip routing in directed networks (extended abstract)

DOI10.1145/343477.343516zbMath1314.68407OpenAlexW2001576673MaRDI QIDQ5176771

Christopher G. Wagner, Lenore J. Cowen

Publication date: 3 March 2015

Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/343477.343516

Mathematics Subject Classification ID

Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Network protocols (68M12) Online algorithms; streaming algorithms (68W27)

Related Items (7)

Source-wise round-trip spanners ⋮ Deterministic improved round-trip spanners ⋮ Cone-based spanners of constant degree ⋮ Compact and localized distributed data structures ⋮ On the VC-dimension of unique round-trip shortest path systems ⋮ Compact roundtrip routing with topology-independent node names ⋮ A fast algorithm for source-wise round-trip spanners

This page was built for publication: Compact roundtrip routing in directed networks (extended abstract)