New bounds for multi-label interval routing
From MaRDI portal
Publication:1884964
DOI10.1016/S0304-3975(03)00318-9zbMath1089.68022MaRDI QIDQ1884964
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68M14: Distributed systems
68M12: Network protocols
Cites Work
- Unnamed Item
- The complexity of shortest path and dilation bounded interval routing
- A survey on interval routing
- Labelling and Implicit Routing in Networks
- Interval Routing
- New Bounds on the Complexity of the Shortest Path Problem
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- On the space requirement of interval routing