On Multi-Label Linear Interval Routing Schemes

DOI10.1093/COMJNL/39.2.133MaRDI QIDQ4886687zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

shortest path routings

Mathematics Subject Classification ID

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

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

Cited in

(14)

• Ordered interval routing schemes
• Multidimensional interval routing schemes
• On devising Boolean Routing Schemes
• On the complexity of multi-dimensional interval routing schemes
• Static and dynamic low-congested interval routing schemes
• The complexity of the characterization of networks supporting shortest-path interval routing.
• All-shortest-path 2-interval routing is NP-complete
• scientific article; zbMATH DE number 1340883 (Why is no real title available?)
• Low-congested interval routing schemes for hypercubelike networks
• Partial characterizations of networks supporting shortest path interval labeling schemes
• Interval routing schemes allow broadcasting with linear message-complexity
• Compact and localized distributed data structures
• A fault-tolerant routing scheme in dynamic networks
• Multi-dimensional Interval Routing Schemes

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)