Large fault-tolerant interconnection networks
From MaRDI portal
Publication:1120553
DOI10.1007/BF01788663zbMath0672.94021OpenAlexW2014754781MaRDI QIDQ1120553
N. Homobono, Claudine Peyrat, Jean-Claude Bermond
Publication date: 1989
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788663
Related Items (41)
On minimum locally $n$-(arc)-strong digraphs ⋮ Edge, vertex and mixed fault diameters ⋮ Large \((d,D, D',s)\)-bipartite digraphs ⋮ On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks ⋮ Extraconnectivity of graphs with large minimum degree and girth ⋮ Extension of de Bruijn graph and Kautz graph ⋮ Diameter vulnerability of iterated line digraphs ⋮ On the diameter vulnerability of Kautz digraphs ⋮ Diameter-vulnerability of large bipartite digraphs ⋮ Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II ⋮ Large fault-tolerant interconnection networks ⋮ Fault-tolerant routings in double fixed-step networks ⋮ On the order and size of \(s\)-geodetic digraphs with given connectivity ⋮ Connectivity of large bipartite digraphs and graphs ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Bipartite graphs and digraphs with maximum connectivity ⋮ The partial diagnosability of interconnection networks under the hybrid PMC model ⋮ Super link-connectivity of iterated line digraphs. ⋮ Diameter vulnerability of GC graphs ⋮ Unnamed Item ⋮ Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ The Hamiltonian property of generalized de Bruijn digraphs ⋮ On the number of spanning trees and Eulerian tours in iterated line digraphs ⋮ The covering radius of doubled 2-designs in \(2O_ k\) ⋮ Connectivity of Kautz networks ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ The covering radius of Hadamard codes in odd graphs ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ The underlying graph of a line digraph ⋮ Approximate Moore graphs are good expanders ⋮ On large (Δ, D, D, 1)-graphs ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Efficient collective communciation in optical networks ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ Extraconnectivity of \(s\)-geodetic digraphs and graphs ⋮ Miscellaneous Digraph Classes ⋮ On the matrix equation \(A^l+A^{l+k}=J_n\) ⋮ The superconnectivity of large digraphs and graphs ⋮ On the distance connectivity of graphs and digraphs
Cites Work
- Diameter vulnerability of graphs
- Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
- Sufficient conditions for maximally connected dense graphs
- Hamiltonian decomposition of Cayley graphs of degree 4
- On fault tolerant routings in general networks
- Efficient fault-tolerant routings in networks
- A new look at fault-tolerant network routing
- Fault diameter of interconnection networks
- Fault-tolerant routings in a \(\kappa\)-connected network
- Large fault-tolerant interconnection networks
- Fault-tolerant routings in Kautz and de Bruijn networks
- The Hamiltonian property of generalized de Bruijn digraphs
- Graphs with small diameter after edge deletion
- Mengerian theorems for paths of bounded length
- Embedding all binary trees in the hypercube
- On forwarding indices of networks
- 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
- On the connectivity of Cayley digraphs
- Über den Zusammenhang symmetrischer Graphen
- The forwarding index of communication networks
- Connectivity of Regular Directed Graphs with Small Diameters
- Line Digraph Iterations and the (d, k) Digraph Problem
- An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
- Circulants and their connectivities
- A Design for Directed Graphs with Minimum Diameter
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- Interconnection Networks Based on a Generalization of Cube-Connected Cycles
- Heuristics for finding a maximum number of disjoint bounded paths
- Reliable circulant networks with minimum transmission delay
- Connectivity of circulant digraphs
- On Group Graphs and Their Fault Tolerance
- Diameter increase caused by edge deletion
- Generalized de Bruijn digraphs
- Connectivity of Imase and Itoh digraphs
- Lower-bounds on the connectivities of a graph
- Highly fault-tolerant communication network models
- Fault Tolerance in Networks of Bounded Degree
- Design to Minimize Diameter on Building-Block Network
- A Fault-Tolerant Communication Architecture for Distributed Systems
- On a measure of communication network vulnerability
- A counterexample to a conjecture on paths of bounded length
- Disjoint paths in a network
- Geodetic connectivity of graphs
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Forwarding indices of consistent routings and their complexity
- On an Optimally Fault-Tolerant Multiprocessor Network Architecture
- The complexity of finding maximum disjoint paths with length constraints
- Diameter bounds for altered graphs
- On (d, k, μ) Graphs
- Connectivity of transitive graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Large fault-tolerant interconnection networks