Fault-tolerant routings in a \(\kappa\)-connected network

DOI10.1016/0020-0190(88)90204-9zbMath0655.94023OpenAlexW1970883114WikidataQ108809082 ScholiaQ108809082MaRDI QIDQ1109755

Makoto Imase, Yoshifumi Manabe

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90204-9

zbMATH Keywords

diameterconnectivityfault tolerancedistributed computingcommunications networkbidirectional routingroute graph

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items

On fault-tolerant fixed routing in hypercubes ⋮ Fault tolerant routing in the star and pancake interconnection networks ⋮ Fault-tolerant routings in a \(\kappa\)-connected network ⋮ Large fault-tolerant interconnection networks ⋮ Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs ⋮ Fault-tolerant routings in Kautz and de Bruijn networks ⋮ Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases ⋮ A plane graph representation of triconnected graphs ⋮ Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs ⋮ Efficient algorithms for a mixed k-partition problem of graphs without specifying bases ⋮ Optimal fault-tolerant routings for connected graphs ⋮ Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs ⋮ Graph theoretical issues in computer networks

Cites Work

• Unnamed Item
• Fault-tolerant routings in a \(\kappa\)-connected network
• Advances in graph theory
• Parallel concepts in graph theory