scientific article; zbMATH DE number 1038840

DOI10.1002/(SICI)1097-0037(199701)29:1%3C49::AID-NET5%3E3.0.CO;2-CMaRDI QIDQ4345573zbMATH OpenFDO

Authors

Publication date 23 July 1997

zbMATH Keywords

optimal labelinginterval routing in arbitrary graphs

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 1340883
• scientific article; zbMATH DE number 4085576
• New bounds for multi-label interval routing
• scientific article; zbMATH DE number 1361484
• scientific article; zbMATH DE number 1517100

Cited in

(12)

• Labelling and Implicit Routing in Networks
• Worst Case Bounds for Shortest Path Interval Routing
• A lower bound for linear interval routing
• scientific article; zbMATH DE number 1760012 (Why is no real title available?)
• New bounds for multi-label interval routing
• scientific article; zbMATH DE number 4085576 (Why is no real title available?)
• A survey on interval routing
• scientific article; zbMATH DE number 1340883 (Why is no real title available?)
• A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing
• A fault-tolerant routing scheme in dynamic networks
• The complexity of shortest path and dilation bounded interval routing
• Partial characterizations of networks supporting shortest path interval labeling schemes

This page was built for publication:

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