Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks

DOI10.1137/S0895480102419743zbMath1142.68620OpenAlexW2013965337MaRDI QIDQ5454267

Petr Kolman, Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler

Publication date: 28 March 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480102419743

zbMATH Keywords

greedy algorithmsmulticommodity flowedge-disjoint pathsfault-tolerant routingflow number

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Maximum \(k\)-splittable \(s, t\)-flows ⋮ Short length Menger's theorem and reliable optical routing ⋮ Unnamed Item

This page was built for publication: Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks