On Minimum Fault-Tolerant Networks

DOI10.1137/0406044MaRDI QIDQ4302268zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

cyclefault-tolerant interconnection networksgridhypercubenetwork architecture preservationpathtorustree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fault-tolerant graphs for tori
• scientific article; zbMATH DE number 913359
• Explicit construction of linear sized tolerant networks. (Reprint)
• Designing optimal fault-tolerant star networks
• Explicit construction of linear sized tolerant networks

Cited in

(35)

• Explicit construction of linear sized tolerant networks
• Minimum congestion redundant assignments to tolerate random faults
• Minimum time broadcast in faulty star networks
• Sparse networks tolerating random faults.
• Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
• Optimal 1-edge fault-tolerant designs for ladders.
• Edge-colored graphs with applications to homogeneous faults
• Minimum \(k\)-critical bipartite graphs
• Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. I: One-fault-tolerant structures
• Explicit construction of linear sized tolerant networks. (Reprint)
• Largest component and node fault tolerance for grids
• On the Nordhaus-Gaddum problem for the edge cost of a graph
• Homogeneous faults, colored edge graphs, and cover free families
• Minimal selectors and fault tolerant networks
• scientific article; zbMATH DE number 436067 (Why is no real title available?)
• scientific article; zbMATH DE number 3843670 (Why is no real title available?)
• scientific article; zbMATH DE number 4208113 (Why is no real title available?)
• Fault tolerant on-board networks with priorities
• Locating Servers for Reliability and Affine Embeddings
• Designing optimal fault-tolerant star networks
• Fault-tolerant extensions of star networks
• scientific article; zbMATH DE number 1256708 (Why is no real title available?)
• scientific article; zbMATH DE number 1043884 (Why is no real title available?)
• scientific article; zbMATH DE number 2038887 (Why is no real title available?)
• scientific article; zbMATH DE number 205336 (Why is no real title available?)
• scientific article; zbMATH DE number 861306 (Why is no real title available?)
• scientific article; zbMATH DE number 913340 (Why is no real title available?)
• Optimal fault-tolerant networks with a server
• Fault-tolerant logical network structures
• Function of structural fault tolerance and d-limited connected component of CS graph
• Fault-tolerant designs in lattice networks on the Klein bottle
• Fault-tolerant design in triangular lattice networks
• Designing distrance-preserving fault-tolerant topologies
• k-fault-tolerant graphs for p disjoint complete graphs of order c
• A note on edge fault tolerance with respect to hypercubes

This page was built for publication: On Minimum Fault-Tolerant Networks

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