On the complexity of multi-dimensional interval routing schemes
DOI10.1016/S0304-3975(99)00284-4zbMATH Open0948.68231OpenAlexW2091225758WikidataQ126311244 ScholiaQ126311244MaRDI QIDQ1575745FDOQ1575745
Authors: Peter Ružička, D. Štefankovič 
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00284-4
Recommendations
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval Routing
- Edge Separators of Planar and Outerplanar Graphs With Applications
- On forwarding indices of networks
- Memory requirement for routing in distributed networks
- Labelling and Implicit Routing in Networks
- Compact routing schemes with low stretch factor
- Memory requirement for universal routing schemes
- Multidimensional interval routing schemes
- Interval routing schemes
- Title not available (Why is that?)
- The Complexity of Interval Routing on Random Graphs
- On Multi-Label Linear Interval Routing Schemes
- Lower bounds for compact routing (extended abstract)
- Title not available (Why is that?)
Cited In (13)
- Title not available (Why is that?)
- Characterization of networks supporting multi-dimensional linear interval routing schemes
- Compact and localized distributed data structures
- On the hardness of minimizing space for all-shortest-path interval routing schemes
- A survey on interval routing
- Title not available (Why is that?)
- Multi-dimensional Interval Routing Schemes
- Searching among intervals and compact routing tables
- The complexity of routing with collision avoidance
- The compactness of adaptive routing tables
- The complexity of the characterization of networks supporting shortest-path interval routing.
- On the computational complexity of continuous routing
- Static and dynamic low-congested interval routing schemes
This page was built for publication: On the complexity of multi-dimensional interval routing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575745)
