A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Optimal fault-tolerant routings with small routing tables for k-connected graphs
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