The following pages link to Interval Routing (Q3798237):
Displaying 37 items.
- An optimal message routing algorithm for double-loop networks (Q293257) (← links)
- Characterization of networks supporting multi-dimensional linear interval routing schemes (Q703538) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- A note on models for graph representations (Q1008739) (← 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)
- Designing networks with compact routing tables (Q1104109) (← links)
- Multidimensional interval routing schemes (Q1275073) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- On devising Boolean Routing Schemes (Q1389768) (← links)
- Interval routing in some planar networks. (Q1401175) (← links)
- The complexity of shortest path and dilation bounded interval routing (Q1575668) (← links)
- A survey on interval routing (Q1575744) (← links)
- On the complexity of multi-dimensional interval routing schemes (Q1575745) (← links)
- Static and dynamic low-congested interval routing schemes (Q1605315) (← links)
- Time-dependent routing (Q1651552) (← 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)
- 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)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
- Characterization results of all shortest paths interval routing schemes (Q2744657) (← links)
- Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
- More on the Efficiency of Interval Routing (Q4226621) (← links)
- Low-congested interval routing schemes for hypercubelike networks (Q4520243) (← links)
- Deadlock-free interval routing schemes (Q5048937) (← links)
- Universal routing schemes (Q5137328) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- Interval routing schemes (Q5916403) (← links)
- Graphs with bounded induced distance (Q5928866) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)
- A fault-tolerant routing scheme in dynamic networks (Q5959357) (← links)
- Multi-dimensional Interval Routing Schemes (Q6084552) (← links)
- Topological routing schemes (Q6570920) (← links)
