Large fault-tolerant interconnection networks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3831957 (Why is no real title available?)
- scientific article; zbMATH DE number 4201663 (Why is no real title available?)
- scientific article; zbMATH DE number 4137792 (Why is no real title available?)
- scientific article; zbMATH DE number 4162905 (Why is no real title available?)
- scientific article; zbMATH DE number 4168704 (Why is no real title available?)
- scientific article; zbMATH DE number 4057550 (Why is no real title available?)
- scientific article; zbMATH DE number 4059299 (Why is no real title available?)
- scientific article; zbMATH DE number 4059450 (Why is no real title available?)
- scientific article; zbMATH DE number 4108811 (Why is no real title available?)
- scientific article; zbMATH DE number 4110714 (Why is no real title available?)
- scientific article; zbMATH DE number 3497930 (Why is no real title available?)
- scientific article; zbMATH DE number 3556138 (Why is no real title available?)
- scientific article; zbMATH DE number 3627227 (Why is no real title available?)
- scientific article; zbMATH DE number 3794103 (Why is no real title available?)
- scientific article; zbMATH DE number 867708 (Why is no real title available?)
- scientific article; zbMATH DE number 3218574 (Why is no real title available?)
- scientific article; zbMATH DE number 3355058 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- A Combinatorial Problem Related to Multimodule Memory Organizations
- A Design for Directed Graphs with Minimum Diameter
- A Fault-Tolerant Communication Architecture for Distributed Systems
- A counterexample to a conjecture on paths of bounded length
- A new look at fault-tolerant network routing
- An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
- Circulants and their connectivities
- Connectivity of Imase and Itoh digraphs
- Connectivity of Regular Directed Graphs with Small Diameters
- Connectivity of circulant digraphs
- Connectivity of transitive graphs
- Counterexamples to theorems of Menger type for the diameter
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. II
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
- Design to Minimize Diameter on Building-Block Network
- Diameter bounds for altered graphs
- Diameter increase caused by edge deletion
- Diameter vulnerability of graphs
- Disjoint paths in a network
- Efficient fault-tolerant routings in networks
- Embedding all binary trees in the hypercube
- Fault Tolerance in Networks of Bounded Degree
- Fault diameter of interconnection networks
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- Fault-tolerant routings in Kautz and de Bruijn networks
- Fault-tolerant routings in a \(\kappa\)-connected network
- Forwarding indices of consistent routings and their complexity
- Generalized de Bruijn digraphs
- Geodetic connectivity of graphs
- Graphs with small diameter after edge deletion
- Hamiltonian decomposition of Cayley graphs of degree 4
- Heuristics for finding a maximum number of disjoint bounded paths
- Highly fault-tolerant communication network models
- Interconnection Networks Based on a Generalization of Cube-Connected Cycles
- Large fault-tolerant interconnection networks
- Line Digraph Iterations and the (d, k) Digraph Problem
- Lower-bounds on the connectivities of a graph
- Mengerian theorems for paths of bounded length
- On (d, k, μ) Graphs
- On Group Graphs and Their Fault Tolerance
- On a measure of communication network vulnerability
- On an Optimally Fault-Tolerant Multiprocessor Network Architecture
- On fault tolerant routings in general networks
- On forwarding indices of networks
- On the connectivity of Cayley digraphs
- Reliable circulant networks with minimum transmission delay
- Sufficient conditions for maximally connected dense graphs
- The Hamiltonian property of generalized de Bruijn digraphs
- The complexity of finding maximum disjoint paths with length constraints
- The forwarding index of communication networks
- Über den Zusammenhang symmetrischer Graphen
Cited in
(52)- On the distance connectivity of graphs and digraphs
- On Group Graphs and Their Fault Tolerance
- Mixed fault diameter of Cartesian graph bundles
- Reliability measures in brother trees
- On the number of spanning trees and Eulerian tours in iterated line digraphs
- On the matrix equation \(A^l+A^{l+k}=J_n\)
- A unified formulation of Kautz network and generalized hypercube
- Efficient collective communciation in optical networks
- Diameter vulnerability of GC graphs
- The covering radius of Hadamard codes in odd graphs
- A regular scalable fault tolerant interconnection network for distributed processing
- Fault-Tolerant Multiprocessor Link and Bus Network Architectures
- The superconnectivity of large digraphs and graphs
- Super edge-connectivity of dense digraphs and graphs
- Connectivity of large bipartite digraphs and graphs
- The partial diagnosability of interconnection networks under the hybrid PMC model
- Large (d,D, D',s)-bipartite digraphs
- On the order and size of s-geodetic digraphs with given connectivity
- The Hamiltonian property of generalized de Bruijn digraphs
- scientific article; zbMATH DE number 4059297 (Why is no real title available?)
- Connectivity of Kautz networks
- Bipartite graphs and digraphs with maximum connectivity
- On minimum locally $n$-(arc)-strong digraphs
- Super line-connectivity of consecutive-\(d\) digraphs
- Superconnectivity of bipartite digraphs and graphs
- Approximate Moore graphs are good expanders
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. II
- The covering radius of doubled 2-designs in \(2O_ k\)
- The underlying graph of a line digraph
- Graphs and algorithms in communication networks on seven league boots
- Diameter-vulnerability of large bipartite digraphs
- Largest component and node fault tolerance for grids
- Super link-connectivity of iterated line digraphs.
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
- On the diameter vulnerability of Kautz digraphs
- Diameter vulnerability of iterated line digraphs
- Fault diameter of interconnection networks
- Edge, vertex and mixed fault diameters
- On large \((\Delta , D, D, 1)\)-graphs
- scientific article; zbMATH DE number 7378741 (Why is no real title available?)
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
- Large fault-tolerant interconnection networks
- On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks
- Extension of de Bruijn graph and Kautz graph
- scientific article; zbMATH DE number 15656 (Why is no real title available?)
- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- Miscellaneous digraph classes
- Fault-tolerant routings in double fixed-step networks
- scientific article; zbMATH DE number 3843670 (Why is no real title available?)
- Extraconnectivity of \(s\)-geodetic digraphs and graphs
- Reliable Omega Interconnected Network for Large-Scale Multiprocessor Systems
- Extraconnectivity of graphs with large minimum degree and girth
This page was built for publication: Large fault-tolerant interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120553)
