The following pages link to A survey on interval routing (Q1575744):
Displaying 21 items.
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- Characterization of networks supporting multi-dimensional linear interval routing schemes (Q703538) (← links)
- Average stretch analysis of compact routing schemes (Q875595) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing (Q1041783) (← links)
- Ordered interval routing schemes (Q1044020) (← links)
- Threshold dominating cliques in random graphs and interval routing (Q1044044) (← links)
- Interval routing in some planar networks. (Q1401175) (← links)
- Interval routing in reliability networks (Q1770375) (← links)
- The compactness of adaptive routing tables (Q1827290) (← links)
- The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
- New bounds for multi-label interval routing (Q1884964) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- All-shortest-path 2-interval routing is NP-complete (Q2380872) (← links)
- On the hardness of minimizing space for all-shortest-path interval routing schemes (Q2465642) (← links)
- Characterization results of all shortest paths interval routing schemes (Q2744657) (← links)
- A SURVEY ON UNDIRECTED CIRCULANT GRAPHS (Q2905302) (← links)
- Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
