Compact roundtrip routing in directed networks
From MaRDI portal
Recommendations
- Compact roundtrip routing in directed networks (extended abstract)
- scientific article; zbMATH DE number 1305501
- Compact routing in directed networks with stretch factor of two
- 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
- On compact and efficient routing in certain graph classes (Extended abstract)
- Compact Routing In Chordal Grids And Other Networks
Cited in
(28)- 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?)
- Compact routing in directed networks with stretch factor of two
- 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)
- Direct routing: Algorithms and complexity
- 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
- New greedy spanners and applications
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)