Interval Routing
From MaRDI portal
Publication:3798237
DOI10.1093/COMJNL/30.4.298zbMATH Open0652.68051OpenAlexW2914484629MaRDI QIDQ3798237FDOQ3798237
Authors: J. Van Leeuwen, Richard B. Tan 
Publication date: 1987
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/30.4.298
Recommendations
Cited In (42)
- Graphs with bounded induced distance
- Algorithms and Computation
- Characterization results of all shortest paths interval routing schemes
- On multi-label linear interval routing schemes
- On compact and efficient routing in certain graph classes
- Topological routing schemes
- Characterization of networks supporting multi-dimensional linear interval routing schemes
- Compact and localized distributed data structures
- New bounds for multi-label interval routing
- On devising Boolean Routing Schemes
- Multidimensional interval routing schemes
- An optimal message routing algorithm for double-loop networks
- Interval routing schemes for circular-arc graphs
- Interval routing schemes
- Interval routing schemes
- Max-stretch reduction for tree spanners
- Designing networks with compact routing tables
- Time-dependent routing
- Title not available (Why is that?)
- Graph theoretical issues in computer networks
- Representing graphs implicitly using almost optimal space
- All-shortest-path 2-interval routing is NP-complete
- On the hardness of minimizing space for all-shortest-path interval routing schemes
- A note on models for graph representations
- A survey on interval routing
- Universal routing schemes
- Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
- A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing
- Multi-dimensional Interval Routing Schemes
- Interval routing schemes allow broadcasting with linear message-complexity
- Ordered interval routing schemes
- A fault-tolerant routing scheme in dynamic networks
- The complexity of shortest path and dilation bounded interval routing
- Interval routing in some planar networks.
- Deadlock-free interval routing schemes
- Interval routing in reliability networks
- The compactness of adaptive routing tables
- The complexity of the characterization of networks supporting shortest-path interval routing.
- On the complexity of multi-dimensional interval routing schemes
- Static and dynamic low-congested interval routing schemes
- On devising Boolean Routing schemes
- Low-congested interval routing schemes for hypercubelike networks
This page was built for publication: Interval Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798237)
