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

DOI10.1016/J.JDA.2004.04.009zbMATH Open1118.68376OpenAlexW1973926450MaRDI QIDQ876733FDOQ876733

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

distributed computingdiameterfault tolerancerouting tablefixed routing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient fault-tolerant routings in networks
• Fault-tolerant routings in a \(\kappa\)-connected network
• New results in graph routing
• On fault tolerant routings in general networks
• A new look at fault-tolerant network routing
• Optimal fault-tolerant routings for connected graphs
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs

Cited In (5)

• Fault-Tolerant Compact Routing Schemes for General Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal fault-tolerant routings for connected graphs
• On the total\(_k\)-diameter of connection networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876733)