Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs

DOI10.1016/j.jda.2004.04.009zbMath1118.68376OpenAlexW1973926450MaRDI QIDQ876733

Koichi Wada, Wei Chen

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.009

zbMATH Keywords

diameterfault tolerancedistributed computingrouting tablefixed routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New results in graph routing
• On fault tolerant routings in general networks
• Efficient fault-tolerant routings in networks
• A new look at fault-tolerant network routing
• Fault-tolerant routings in a \(\kappa\)-connected network
• Optimal fault-tolerant routings for connected graphs
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs

This page was built for publication: Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs