New bounds for multi-label interval routing

DOI10.1016/S0304-3975(03)00318-9MaRDI QIDQ1884964zbMATH OpenFDO

Authors Yanyan Li

Publication date 27 October 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(03)00318-9

zbMATH Keywords

compact routingnetwork protocolsplanar graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network protocols (68M12) Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1038840
• scientific article; zbMATH DE number 1361484
• scientific article; zbMATH DE number 1517100
• scientific article; zbMATH DE number 1340883
• Worst Case Bounds for Shortest Path Interval Routing

Cites work

• A survey on interval routing
• Fast Distributed Construction of Smallk-Dominating Sets and Applications
• scientific article; zbMATH DE number 2044937 (Why is no real title available?)
• Interval Routing
• Labelling and Implicit Routing in Networks
• New Bounds on the Complexity of the Shortest Path Problem
• On the space requirement of interval routing
• The complexity of shortest path and dilation bounded interval routing

Cited in

(1)

• scientific article; zbMATH DE number 1038840 (Why is no real title available?)

This page was built for publication: New bounds for multi-label interval routing

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