On compact and efficient routing in certain graph classes (Extended abstract)
From MaRDI portal
Recommendations
- On compact and efficient routing in certain graph classes
- Compact routing schemes for bounded tree-length graphs and for k-chordal graphs
- Improved compact routing scheme for chordal graphs
- Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes
- An additive stretched routing scheme for chordal graphs
Cited in
(15)- Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
- Equivalence between pathbreadth and strong pathbreadth
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces
- Label-based routing for a family of scale-free, modular, planar and unclustered graphs
- Compact Forbidden-Set Routing
- Compact Routing in Power-Law Graphs
- scientific article; zbMATH DE number 3920515 (Why is no real title available?)
- Improved compact routing scheme for chordal graphs
- Compact roundtrip routing in directed networks
- A new approach for routing in arrangement graphs and its performance evaluation
- Distributed Relationship Schemes for Trees
- Compact routing schemes for bounded tree-length graphs and for k-chordal graphs
- Short Labels by Traversal and Jumping
- Compact-port routing models and applications to distance-hereditary graphs
- On compact and efficient routing in certain graph classes
This page was built for publication: On compact and efficient routing in certain graph classes (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712130)