The following pages link to Algorithms and Computation (Q5712130):
Displaying 12 items.
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs (Q1613354) (← links)
- Equivalence between pathbreadth and strong pathbreadth (Q2416435) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- Compact Forbidden-Set Routing (Q3590921) (← links)
- Compact Routing in Power-Law Graphs (Q3646238) (← links)
- (Q3697045) (← links)
- Compact roundtrip routing in directed networks (Q4819695) (← links)
- A new approach for routing in arrangement graphs and its performance evaluation (Q5096356) (← links)
- Distributed Relationship Schemes for Trees (Q5387807) (← links)
- Short Labels by Traversal and Jumping (Q5899392) (← links)
- Compact-port routing models and applications to distance-hereditary graphs (Q5959185) (← links)