Fault-tolerant diameter for three family interconnection networks
From MaRDI portal
Publication:437063
DOI10.1007/S10878-010-9362-2zbMATH Open1270.90093OpenAlexW2130577900MaRDI QIDQ437063FDOQ437063
Authors: Tongliang Shi, Mei Lu
Publication date: 17 July 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9362-2
Recommendations
Cites Work
- Restricted connectivity for three families of interconnection networks
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- Fault diameter of interconnection networks
- Super-connectivity and super-edge-connectivity for some interconnection networks
- On the diameter vulnerability of Kautz digraphs
- Fault diameter of Cartesian product graphs
- Fault-diameter of Cartesian graph bundles
- Fault diameter of product graphs
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Cited In (15)
- Topological properties on the diameters of the integer simplex
- Title not available (Why is that?)
- Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
- The Component (Edge) Connectivity of Round Matching Composition Networks
- The vulnerability of the diameter of the enhanced hypercubes
- On the fault-tolerant diameter and wide diameter of ?-connected graphs
- Fault tolerance of the star graph interconnection network
- A diagnosis algorithm by using graph-coloring under the PMC model
- Fault diameter of interconnection networks
- Conditional diagnosability of the round matching composition networks
- The diameter vulnerability of the generalized Petersen graph \(GP[tk,k]\)
- Title not available (Why is that?)
- Large fault-tolerant interconnection networks
- Conditional diagnosability of the \(\mathit{SP}_n\) graphs under the comparison diagnosis model
- On the total\(_k\)-diameter of connection networks
This page was built for publication: Fault-tolerant diameter for three family interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q437063)