Compact roundtrip routing in directed networks

DOI10.1016/J.JALGOR.2003.08.001MaRDI QIDQ4819695zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Compact roundtrip routing in directed networks (extended abstract)
• scientific article; zbMATH DE number 1305501
• scientific article; zbMATH DE number 2080868
• On compact and efficient routing in certain graph classes
• scientific article; zbMATH DE number 2119746
• Roundtrip spanners and roundtrip routing in directed graphs
• Compact Routing in Power-Law Graphs
• Compact Routing in Unit Disk Graphs
• Algorithms and Computation
• Compact Routing In Chordal Grids And Other Networks

Cited in

(27)

• New pairwise spanners
• NP-hardness and fixed-parameter tractability of the minimum spanner problem
• A parallel bio-inspired shortest path algorithm
• Disk-based shortest path discovery using distance index over large dynamic graphs
• Direct routing: Algorithms and complexity
• Improved approximation for the directed spanner problem
• Small stretch pairwise spanners and approximate D-preservers
• Compact Routing in Power-Law Graphs
• scientific article; zbMATH DE number 1305501 (Why is no real title available?)
• scientific article; zbMATH DE number 2080868 (Why is no real title available?)
• Directional Routing via Generalized st-Numberings
• scientific article; zbMATH DE number 2119746 (Why is no real title available?)
• Multipath spanners via fault-tolerant spanners
• Transitive-closure spanners: a survey
• Roundtrip spanners and roundtrip routing in directed graphs
• Compact roundtrip routing in directed networks (extended abstract)
• Algorithms – ESA 2004
• Compact roundtrip routing with topology-independent node names
• Compact roundtrip routing with topology-independent node names
• Distributed algorithms for ultrasparse spanners and linear size skeletons
• Compact-port routing models and applications to distance-hereditary graphs
• Reachability Preservers: New Extremal Bounds and Approximation Algorithms
• Oriented spanners
• Color fault-tolerant spanners
• Spanner approximations in practice
• Approximation algorithms for directed weighted spanners
• Directed buy-at-bulk spanners

This page was built for publication: Compact roundtrip routing in directed networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819695)