Large fault-tolerant interconnection networks
type: Item
instance of: scholarly article
title: Large fault-tolerant interconnection networks
zbMATH Open document ID: 0672.94021
DOI: 10.1007/BF01788663
author: N. Homobono
author: Jean-Claude Bermond
author: Claudine Peyrat
published in: Graphs and Combinatorics
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 4101105
zbMATH Keywords: reliability
zbMATH Keywords: fault-tolerant properties of networks
zbMATH Keywords: diameter vulnerability
zbMATH Keywords: de Bruijn and Kautz networks
MaRDI profile type: Publication
cites work: On Group Graphs and Their Fault Tolerance
cites work: Q5668821
cites work: Q4739935
cites work: Q3039368
cites work: Hamiltonian decomposition of Cayley graphs of degree 4
cites work: Q3350798
cites work: Circulants and their connectivities
cites work: Reliable circulant networks with minimum transmission delay
cites work: Q4129477
cites work: Q3834069
cites work: Counterexamples to theorems of Menger type for the diameter
cites work: A counterexample to a conjecture on paths of bounded length
cites work: Efficient fault-tolerant routings in networks
cites work: Q5834367
cites work: Interconnection Networks Based on a Generalization of Cube-Connected Cycles
cites work: Q3470486
cites work: Graphs with small diameter after edge deletion
cites work: The forwarding index of communication networks
cites work: Diameter bounds for altered graphs
cites work: A new look at fault-tolerant network routing
cites work: Connectivity of circulant digraphs
cites work: The Hamiltonian property of generalized de Bruijn digraphs
cites work: Generalized de Bruijn digraphs
cites work: Fault Tolerance in Networks of Bounded Degree
cites work: Geodetic connectivity of graphs
cites work: Q3794087
cites work: Lower-bounds on the connectivities of a graph
cites work: Fault-Tolerant Routing in DeBruijn Comrnunication Networks
cites work: On a measure of communication network vulnerability
cites work: Q3490015
cites work: Q3794217
cites work: Q4873825
cites work: Line Digraph Iterations and the (d, k) Digraph Problem
cites work: On the connectivity of Cayley digraphs
cites work: Forwarding indices of consistent routings and their complexity
cites work: On forwarding indices of networks
cites work: Q3792715
cites work: Fault-tolerant routings in Kautz and de Bruijn networks
cites work: Connectivity of Imase and Itoh digraphs
cites work: Design to Minimize Diameter on Building-Block Network
cites work: A Design for Directed Graphs with Minimum Diameter
cites work: Fault-tolerant routings in a \(\kappa\)-connected network
cites work: Connectivity of Regular Directed Graphs with Small Diameters
cites work: The complexity of finding maximum disjoint paths with length constraints
cites work: Q5629652
cites work: Fault diameter of interconnection networks
cites work: Mengerian theorems for paths of bounded length
cites work: Über den Zusammenhang symmetrischer Graphen
cites work: Q4189309
cites work: Q3495375
cites work: Q3832603
cites work: Highly fault-tolerant communication network models
cites work: On fault tolerant routings in general networks
cites work: Diameter vulnerability of graphs
cites work: Q4079637
cites work: A Fault-Tolerant Communication Architecture for Distributed Systems
cites work: On (d, k, μ) Graphs
cites work: Heuristics for finding a maximum number of disjoint bounded paths
cites work: Diameter increase caused by edge deletion
cites work: An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
cites work: On an Optimally Fault-Tolerant Multiprocessor Network Architecture
cites work: Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II
cites work: Sufficient conditions for maximally connected dense graphs

Large fault-tolerant interconnection networks (cites work)
cites work: Large fault-tolerant interconnection networks

Large fault-tolerant interconnection networks (cites work)
cites work: Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter

Large fault-tolerant interconnection networks (cites work)
cites work: Disjoint paths in a network

Large fault-tolerant interconnection networks (cites work)
cites work: Q5345644

Large fault-tolerant interconnection networks (cites work)
cites work: Embedding all binary trees in the hypercube

Large fault-tolerant interconnection networks (cites work)
cites work: Connectivity of transitive graphs

Large fault-tolerant interconnection networks (cites work)
cites work: A Combinatorial Problem Related to Multimodule Memory Organizations

Large fault-tolerant interconnection networks (full work available at URL)
full work available at URL: https://doi.org/10.1007/bf01788663

Large fault-tolerant interconnection networks (OpenAlex ID)
OpenAlex ID: W2014754781