Pages that link to "Item:Q4099527"
From MaRDI portal
The following pages link to A Graph Model for Fault-Tolerant Computing Systems (Q4099527):
Displaying 50 items.
- T-irreducible extension of polygonal digraphs (Q283070) (← links)
- Remarks on Caristi's fixed point theorem in metric spaces with a graph (Q287548) (← links)
- Lattice graphs with non-concurrent longest cycles (Q481029) (← links)
- Near packings of two graphs (Q512568) (← links)
- On the complexity of some problems related to graph extensions (Q650325) (← links)
- Networks with small stretch number (Q876723) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- Explicit construction of linear sized tolerant networks (Q1110541) (← links)
- Analysis of minimal path routing schemes in the presence of faults (Q1199428) (← links)
- Chordal rings as fault-tolerant loops (Q1199459) (← links)
- Quantifying fault recovery in multiprocessor systems (Q1310239) (← links)
- Tolerating faults in a mesh with a row of spare nodes (Q1330431) (← links)
- Finding a target subnetwork in sparse networks with random faults (Q1334631) (← links)
- Dynamic graph models (Q1368531) (← links)
- A local-sparing design methodology for fault-tolerant multiprocessors (Q1388972) (← links)
- Fault tolerant supergraphs with automorphisms (Q1720338) (← links)
- Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs (Q1727753) (← links)
- (\(k,+\))-distance-hereditary graphs (Q1827274) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- Fault-tolerant metric dimension of generalized wheels and convex polytopes (Q2214773) (← links)
- Gallai's property for graphs in lattices on the torus and the Möbius strip (Q2400087) (← links)
- Explicit construction of linear sized tolerant networks. (Reprint) (Q2498004) (← links)
- Embedding of the folded hypercubes into tori (Q2516503) (← links)
- Self-spanner graphs (Q2565853) (← links)
- Largest component and node fault tolerance for grids (Q2656897) (← links)
- Analysis and design of a fault-tolerant tree architecture (Q3352513) (← links)
- Minced trees, with applications to fault-tolerant VLSI processor arrays (Q3738575) (← links)
- Highly non-concurrent longest paths in lattices (Q4633080) (← links)
- Fault tolerance of Möbius cubes under two forbidden fault set models (Q4828658) (← links)
- Vertex extensions of 4-layer graphs and hypercubes (Q5059988) (← links)
- THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS (Q5067355) (← links)
- Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection (Q5122697) (← links)
- (Q5146181) (← links)
- (Q5146739) (← links)
- (Q5147388) (← links)
- (Q5150413) (← links)
- (Q5150417) (← links)
- (Q5150437) (← links)
- (Q5150496) (← links)
- (Q5150498) (← links)
- (Q5150517) (← links)
- (Q5150590) (← links)
- (Q5150643) (← links)
- (Q5150664) (← links)
- NUMBER OF INACCESSIBLE STATES IN FINITE DYNAMIC SYSTEMS OF BINARY VECTORS ASSOCIATED WITH PALMS ORIENTATIONS (Q5150700) (← links)
- T-IRREDUCIBLE EXTENSIONS OF DIRECTED STARLIKE TREES (Q5150758) (← links)
- ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION (Q5151083) (← links)
- Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives (Q5218295) (← links)
- About uniqueness of the minimal 1-edge extension of hypercube Q4 (Q5871441) (← links)
- Designing distrance-preserving fault-tolerant topologies (Q6550558) (← links)
