Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. I: One-fault-tolerant structures
From MaRDI portal
(Redirected from Publication:2487516)
Eulerian and Hamiltonian graphs (05C45) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Fault detection; testing in circuits and networks (94C12) Applications of graph theory to circuits and networks (94C15)
Recommendations
- Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II: Grids and \(k\)-fault-tolerance
- Designing fault-tolerant systems using automorphisms
- scientific article; zbMATH DE number 913541
- A group-invariant approach to the synthesis of fault-tolerant systems
- On Minimum Fault-Tolerant Networks
Cited in
(9)- Designing fault-tolerant systems using automorphisms
- A group-invariant approach to the synthesis of fault-tolerant systems
- Optimizing the fault-tolerant embedding of the diagnostic graph into the toroidal structures of robust computer systems
- An approach to self-diagnosis of nonuniform digital systems
- Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II: Grids and \(k\)-fault-tolerance
- On the construction of combined k-fault-tolerant Hamiltonian graphs
- Reconfiguration for Repair in a Class of Universal Logic Modules
- Reconfiguration graph grammar for massively parallel, fault tolerant computers
- Design of the EPLD-based reconfigurable fault-tolerant systems with cell-level redundancy
This page was built for publication: Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. I: One-fault-tolerant structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487516)
