Generalized diameters and Rabin numbers of networks

DOI10.1023/A:1009728720073zbMath0924.90128MaRDI QIDQ1288475

Sheng-Chyang Liaw, Gerard Jennhwa Chang

Publication date: 20 July 1999

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

connectivitydiameter of a graphRabin number of a graphshort disjoint paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (14)

A diagnosis algorithm by using graph-coloring under the PMC model ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ Property P_d,m and efficient design of reliable networks ⋮ On reliability of the folded hypercubes ⋮ An efficient construction of one-to-many node-disjoint paths in folded hypercubes ⋮ On robust clusters of minimum cardinality in networks ⋮ Cycles in folded hypercubes ⋮ The spanning connectivity of folded hypercubes ⋮ Efficient Parallel Routing Algorithms for Cartesian and Composition Networks ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes ⋮ Hamiltonian connectivity of the WK-recursive network with faulty nodes ⋮ Strong Rabin numbers of folded hypercubes ⋮ Rabin numbers of Butterfly networks ⋮ Fault-tolerant routing in circulant networks and cycle prefix networks

This page was built for publication: Generalized diameters and Rabin numbers of networks