Pages that link to "Item:Q997073"
From MaRDI portal
The following pages link to On compact and efficient routing in certain graph classes (Q997073):
Displaying 19 items.
- New results in graph routing (Q690239) (← links)
- Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs (Q1613354) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- Waypoint routing on bounded treewidth graphs (Q2234792) (← links)
- Search for \(C\)-optimal routes in graphs (Q2413117) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- On Strong Tree-Breadth (Q2958304) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- Homotopic Rectilinear Routing with Few Links and Thick Edges (Q3557041) (← links)
- Compact Forbidden-Set Routing (Q3590921) (← links)
- Control of Some Graph Invariants in Dynamic Routing (Q3627672) (← links)
- Compact Routing in Power-Law Graphs (Q3646238) (← links)
- (Q3697045) (← links)
- Compact roundtrip routing in directed networks (Q4819695) (← links)
- Roundtrip spanners and roundtrip routing in directed graphs (Q4962734) (← links)
- A new approach for routing in arrangement graphs and its performance evaluation (Q5096356) (← links)
- Algorithms and Computation (Q5712130) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- Compact-port routing models and applications to distance-hereditary graphs (Q5959185) (← links)