On the complexity of multi-dimensional interval routing schemes

DOI10.1016/S0304-3975(99)00284-4zbMath0948.68231OpenAlexW2091225758WikidataQ126311244 ScholiaQ126311244MaRDI QIDQ1575745

Daniel Štefanković, Peter Ružička

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

zbMATH Keywords

interconnection networkscongestionspace complexityinterval routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (4)

Compact and localized distributed data structures ⋮ The compactness of adaptive routing tables ⋮ A survey on interval routing ⋮ Static and dynamic low-congested interval routing schemes

Cites Work

• Multidimensional interval routing schemes
• On forwarding indices of networks
• Memory requirement for routing in distributed networks
• Labelling and Implicit Routing in Networks
• Interval Routing
• The Complexity of Interval Routing on Random Graphs
• Edge Separators of Planar and Outerplanar Graphs With Applications
• Lower bounds for compact routing
• Compact routing schemes with low stretch factor
• On Multi-Label Linear Interval Routing Schemes
• Memory requirement for universal routing schemes
• Interval routing schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of multi-dimensional interval routing schemes