Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs
From MaRDI portal
Publication:6122224
DOI10.1007/3-540-60618-1_76MaRDI QIDQ6122224
Unnamed Author, Wei Chen, Kimio Kawaguchi, Koichi Wada
Publication date: 28 February 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
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)
Cites Work
- Unnamed Item
- New results in graph routing
- On fault tolerant routings in general networks
- Efficient fault-tolerant routings in networks
- On computing a conditional edge-connectivity of a graph
- A new look at fault-tolerant network routing
- Conditional connectivity
- Combinatorial analysis of the fault-diameter of the n-cube
This page was built for publication: Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs