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

Koichi Wada, Wei Chen
2004 Journal of Discrete Algorithms  
We study the problem of designing fault-tolerant routings with small routing tables for a kconnected network of n processors in the surviving route graph model. The surviving route graph R (G, ρ)
doi:10.1016/j.jda.2004.04.009 fatcat:3cu6wpw5draodibcpamzlkasuu