Compact roundtrip routing in directed networks
From MaRDI portal
Publication:4819695
DOI10.1016/j.jalgor.2003.08.001zbMath1090.68115OpenAlexW2056403031MaRDI QIDQ4819695
Christopher G. Wagner, Lenore J. Cowen
Publication date: 4 October 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2003.08.001
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Small Stretch Pairwise Spanners and Approximate $D$-Preservers ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ New pairwise spanners ⋮ A parallel bio-inspired shortest path algorithm ⋮ Improved Approximation for the Directed Spanner Problem ⋮ Compact roundtrip routing with topology-independent node names ⋮ Multipath Spanners via Fault-Tolerant Spanners ⋮ Transitive-Closure Spanners: A Survey ⋮ NP-hardness and fixed-parameter tractability of the minimum spanner problem ⋮ Disk-based shortest path discovery using distance index over large dynamic graphs ⋮ Distributed algorithms for ultrasparse spanners and linear size skeletons
This page was built for publication: Compact roundtrip routing in directed networks
