The following pages link to Interval routing schemes (Q5906912):
Displaying 15 items.
- Characterization of networks supporting multi-dimensional linear interval routing schemes (Q703538) (← links)
- Ordered interval routing schemes (Q1044020) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← 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)
- Distance labeling schemes for well-separated graph classes (Q1765518) (← links)
- The compactness of adaptive routing tables (Q1827290) (← links)
- Bounding the locality of distributed routing algorithms (Q2375823) (← links)
- Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)