On multi-label linear interval routing schemes

DOI10.1007/3-540-57899-4_64zbMath1528.68305OpenAlexW1572670762MaRDI QIDQ6143989

Danny Krizanc, S. S. Ravi, Evangelos Kranakis

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57899-4_64

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Designing networks with compact routing tables
• Improved routing strategies with succinct tables
• Labelling and Implicit Routing in Networks
• Space-Efficient Message Routing inc-Decomposable Networks
• Interval Routing
• Efficient Message Routing in Planar Networks
• Routing with Polynomial Communication-Space Trade-Off
• Prefix routing schemes in dynamic networks

This page was built for publication: On multi-label linear interval routing schemes