On Minimum Fault-Tolerant Networks
From MaRDI portal
Publication:4302268
DOI10.1137/0406044zbMath0801.05025OpenAlexW2025153943MaRDI QIDQ4302268
No author found.
Publication date: 14 August 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0406044
treehypercubecycletoruspathgridfault-tolerant interconnection networksnetwork architecture preservation
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
Largest component and node fault tolerance for grids ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ Minimum \(k\)-critical bipartite graphs ⋮ Optimal 1-edge fault-tolerant designs for ladders. ⋮ A note on edge fault tolerance with respect to hypercubes
This page was built for publication: On Minimum Fault-Tolerant Networks