Fault-tolerant routings in Kautz and de Bruijn networks
From MaRDI portal
Publication:1123801
DOI10.1016/0166-218X(92)90283-GzbMATH Open0677.90028MaRDI QIDQ1123801FDOQ1123801
Authors: N. Homobono, Claudine Peyrat
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)
Cites Work
Cited In (18)
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
- Fault-tolerant designs in lattice networks on the Klein bottle
- The maximal restricted edge connectivity of Kautz undirected graphs
- Efficient fault-tolerant routings in networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing
- Fault-tolerant routings in chordal ring networks
- The underlying graph of a line digraph
- On fault tolerant routings in general networks
- Distributed fault-tolerant routing in Kautz networks
- Network routing on regular digraphs and their line graphs
- Large fault-tolerant interconnection networks
- On fault-tolerant fixed routing in hypercubes
- Parity conditions in homotopic knock-knee routing
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
- On 3-restricted edge connectivity of undirected binary Kautz graphs
This page was built for publication: Fault-tolerant routings in Kautz and de Bruijn networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123801)