Deadlock-free interval routing schemes

DOI10.1007/BFb0023472zbMath1498.68020OpenAlexW1534598974MaRDI QIDQ5048937

Michele Flammini

Publication date: 9 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0023472

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Interval routing in some planar networks. ⋮ A survey on interval routing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Designing networks with compact routing tables
• Labelling and Implicit Routing in Networks
• The complexity of interval routing on random graphs
• Interval Routing
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Requirements for deadlock-free, adaptive packet routing
• Interval routing schemes

This page was built for publication: Deadlock-free interval routing schemes