New results in graph routing

DOI10.1006/inco.1993.1053zbMath0781.68090OpenAlexW2076031212MaRDI QIDQ690239

Kimio Kawaguchi, Koichi Wada

Publication date: 20 December 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1993.1053

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Fault tolerant routing in the star and pancake interconnection networks ⋮ Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs ⋮ Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs ⋮ Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs