On Multi-Label Linear Interval Routing Schemes
From MaRDI portal
Publication:4886687
DOI10.1093/comjnl/39.2.133zbMath0856.68021OpenAlexW2130026731MaRDI QIDQ4886687
S. S. Ravi, Danny Krizanc, Evangelos Kranakis
Publication date: 30 October 1996
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/39.2.133
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (12)
All-shortest-path 2-interval routing is NP-complete ⋮ On devising Boolean Routing Schemes ⋮ Multi-dimensional Interval Routing Schemes ⋮ Interval routing schemes allow broadcasting with linear message-complexity ⋮ Compact and localized distributed data structures ⋮ Low-congested interval routing schemes for hypercubelike networks ⋮ A fault-tolerant routing scheme in dynamic networks ⋮ Multidimensional interval routing schemes ⋮ On the complexity of multi-dimensional interval routing schemes ⋮ Ordered interval routing schemes ⋮ The complexity of the characterization of networks supporting shortest-path interval routing. ⋮ Static and dynamic low-congested interval routing schemes
This page was built for publication: On Multi-Label Linear Interval Routing Schemes
