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

Bollobás, 1978 Broder, 1987, Efficient fault tolerant routing in network, Inform. and Comput, 75, 52, 10.1016/0890-5401(87)90063-0 Cidon, 1994, A scalable approach to routing in ATM networks, vol. 859, 209 Dolev, 1987, A new look at fault tolerant routing, Inform. and Comput, 72, 180, 10.1016/0890-5401(87)90031-9 Evens, 1979 Feldman, 1985, Fault tolerance of minimal path routing in a network, 327 Györi, 1978, On division of connected subgraphs, 485 Harary, 1969 Imase, 1988, Fault-tolerant routings in a κ-connected networks, Inform. Process. Lett, 28, 171, 10.1016/0020-0190(88)90204-9 Kawaguchi, 1993, New results in graph routing, Inform. and Comput, 106, 203, 10.1006/inco.1993.1053 Peleg, 1987, On fault tolerant routing in general graph, Inform. and Comput, 74, 33, 10.1016/0890-5401(87)90010-1 Wada, 1997, Optimal fault-tolerant ATM-routings for biconnected graphs, vol. 1335, 354 Wada, 1992, Efficient fault-tolerant fixed routings on (k+1)-connected digraphs, Discrete Appl. Math, 37/38, 539, 10.1016/0166-218X(92)90157-6 Wada, 1992, Optimal fault-tolerant routings for connected graphs, Inform. Process. Lett, 41, 169, 10.1016/0020-0190(92)90048-Z Wada, 1992, A linear time (L,k)-edge-partition algorithm for connected graphs and fault-tolerant routings for k-edge-connected graphs, Trans. IEICE, J75-D-I, 993