New results in graph routing

DOI10.1006/INCO.1993.1053MaRDI QIDQ690239zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• New results on routing via matchings on graphs
• Routing in graphs
• A new approach for routing in arrangement graphs and its performance evaluation
• New hardness results for routing on disjoint paths
• New hardness results for routing on disjoint paths
• On compact and efficient routing in certain graph classes
• Dynamic Routing Schemes for General Graphs
• Publication:3210199

Cited in

(10)

• Fault-tolerant fixed routing in hypercube generalizations
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• Routing in graphs
• scientific article; zbMATH DE number 1769329 (Why is no real title available?)
• Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs
• A new look at fault-tolerant network routing
• Fault tolerant routing in the star and pancake interconnection networks
• Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
• A new approach for routing in arrangement graphs and its performance evaluation
• Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs

This page was built for publication: New results in graph routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690239)