On Multi-Label Linear Interval Routing Schemes

DOI10.1093/COMJNL/39.2.133zbMATH Open0856.68021OpenAlexW2130026731MaRDI QIDQ4886687FDOQ4886687

Authors: S. S. Ravi, Evangelos Kranakis, D. Krizanc 

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

Recommendations

• Partial characterizations of networks supporting shortest path interval labeling schemes
• scientific article; zbMATH DE number 1038840
• scientific article; zbMATH DE number 1340883
• Interval routing schemes
• Interval Routing

zbMATH Keywords

shortest path routings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cited In (14)

• Compact and localized distributed data structures
• On devising Boolean Routing Schemes
• Multidimensional interval routing schemes
• All-shortest-path 2-interval routing is NP-complete
• Title not available (Why is that?)
• 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 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
• Partial characterizations of networks supporting shortest path interval labeling schemes
• Low-congested interval routing schemes for hypercubelike networks

This page was built for publication: On Multi-Label Linear Interval Routing Schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886687)