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