scientific article; zbMATH DE number 1361484

zbMATH Open0941.68097MaRDI QIDQ4699302FDOQ4699302

Authors: Cyril Gavoille 

Publication date: 3 August 2000

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1517100
• The complexity of shortest path and dilation bounded interval routing
• scientific article; zbMATH DE number 1760012

zbMATH Keywords

interval routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (11)

• A lower bound for linear interval routing
• Title not available (Why is that?)
• Title not available (Why is that?)
• New bounds for multi-label interval routing
• A survey on interval routing
• Title not available (Why is that?)
• A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing
• Interval routing in reliability 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

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 Q4699302)