A diagnosis algorithm by using graph-coloring under the PMC model
From MaRDI portal
Publication:326504
DOI10.1007/s10878-015-9923-5zbMath1354.90160OpenAlexW1050549874WikidataQ115146410 ScholiaQ115146410MaRDI QIDQ326504
Cun-Quan Zhang, Guodong Guo, Qiang Zhu, Wen Liang Tang
Publication date: 12 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9923-5
Related Items (4)
Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model ⋮ The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks ⋮ The non-inclusive diagnosability of regular graphs ⋮ Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems
Cites Work
- Unnamed Item
- Fault-tolerant diameter for three family interconnection networks
- A fast fault-identification algorithm for bijective connection graphs using the PMC model
- Fault diameter of interconnection networks
- Generalized diameters and Rabin numbers of networks
- A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
- Spanning 3-connected index of graphs
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- A fault diagnosis algorithm for asymmetric modular architectures
- A Theory of Diagnosability of Digital Systems
- An Efficient Fault Diagnosis Algorithm for Symmetric Multiple Processor Architectures
- Characterization of Connection Assignment of Diagnosable Systems
- Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
- Efficient Fault Identification of Diagnosable Systems under the Comparison Model
- Diagnosability of regular systems
- Optimal numberings and isoperimetric problems on graphs
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication: A diagnosis algorithm by using graph-coloring under the PMC model
