A Graph Model for Fault-Tolerant Computing Systems
From MaRDI portal
Cited in
(57)- A local-sparing design methodology for fault-tolerant multiprocessors
- Fault tolerance of Möbius cubes under two forbidden fault set models
- Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
- Fault-tolerant metric dimension of generalized wheels and convex polytopes
- Gallai's property for graphs in lattices on the torus and the Möbius strip
- k-fault-tolerant graphs for p disjoint complete graphs of order c
- T-irreducible extension of polygonal digraphs
- T-irreducible extensions of directed starlike trees
- Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives
- Construction of all minimal edge extensions of the graph with isomorphism rejection
- Vertex extensions of 4-layer graphs and hypercubes
- About uniqueness of the minimal 1-edge extension of hypercube Q4
- Remarks on Caristi's fixed point theorem in metric spaces with a graph
- The minimal vertex extensions for colored complete graphs
- On the complexity of some problems related to graph extensions
- (k,+)-distance-hereditary graphs
- Dynamic graph models
- A survey of the theory of hypercube graphs
- Explicit construction of linear sized tolerant networks
- Networks with small stretch number
- Temporally connected components
- Quantifying fault recovery in multiprocessor systems
- Minimum k-critical-bipartite graphs: the irregular case
- scientific article; zbMATH DE number 7301718 (Why is no real title available?)
- scientific article; zbMATH DE number 7301787 (Why is no real title available?)
- scientific article; zbMATH DE number 7310069 (Why is no real title available?)
- scientific article; zbMATH DE number 7310088 (Why is no real title available?)
- scientific article; zbMATH DE number 7310134 (Why is no real title available?)
- scientific article; zbMATH DE number 7310136 (Why is no real title available?)
- scientific article; zbMATH DE number 7310216 (Why is no real title available?)
- scientific article; zbMATH DE number 7310261 (Why is no real title available?)
- scientific article; zbMATH DE number 7310279 (Why is no real title available?)
- NUMBER OF INACCESSIBLE STATES IN FINITE DYNAMIC SYSTEMS OF BINARY VECTORS ASSOCIATED WITH PALMS ORIENTATIONS
- Largest component and node fault tolerance for grids
- Embedding of the folded hypercubes into tori
- scientific article; zbMATH DE number 7310071 (Why is no real title available?)
- Analysis and design of a fault-tolerant tree architecture
- Tolerating faults in a mesh with a row of spare nodes
- Finding a target subnetwork in sparse networks with random faults
- Lattice graphs with non-concurrent longest cycles
- Minced trees, with applications to fault-tolerant VLSI processor arrays
- scientific article; zbMATH DE number 7300406 (Why is no real title available?)
- Highly non-concurrent longest paths in lattices
- ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION
- Analysis of minimal path routing schemes in the presence of faults
- Chordal rings as fault-tolerant loops
- The upper and lower bounds for the number of additional arcs in a minimal edge 1-extension of oriented cycle
- About the uniqueness of the minimal 1-edge extension of a hypercube
- Schemes for constructing minimal vertex 1-extensions of complete bicolored graphs
- Regular vertex 1-extension for 2-dimension meshes
- Self-spanner graphs
- Minimum \(k\)-critical bipartite graphs
- Characterization of graphs with a given number of additional edges in a minimal 1-vertex extension
- Near packings of two graphs
- Explicit construction of linear sized tolerant networks. (Reprint)
- Designing distrance-preserving fault-tolerant topologies
- Fault tolerant supergraphs with automorphisms
This page was built for publication: A Graph Model for Fault-Tolerant Computing Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099527)
