A diagnosis algorithm by using graph-coloring under the PMC model

DOI10.1007/S10878-015-9923-5zbMATH Open1354.90160OpenAlexW1050549874WikidataQ115146410 ScholiaQ115146410MaRDI QIDQ326504FDOQ326504

Authors: Guodong Guo, Cun-Quan Zhang, Qiang Zhu, Wenliang 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

Recommendations

• On diagnosability of large multiprocessor networks
• System diagnosis with smallest risk of error
• Diagnosis of ${t / {(t + 1)}}$-Diagnosable Systems
• scientific article; zbMATH DE number 219255
• On diagnosability of large multiprocessor networks

zbMATH Keywords

interconnection networksPMC modeldiagnosis algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Graph theory with applications
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• A Theory of Diagnosability of Digital Systems
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Characterization of Connection Assignment of Diagnosable Systems
• A fast fault-identification algorithm for bijective connection graphs using the PMC model
• Optimal numberings and isoperimetric problems on graphs
• Efficient Fault Identification of Diagnosable Systems under the Comparison 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
• A fault diagnosis algorithm for asymmetric modular architectures
• An Efficient Fault Diagnosis Algorithm for Symmetric Multiple Processor Architectures
• Fault-tolerant diameter for three family interconnection networks
• Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
• Diagnosability of regular systems

Cited In (10)

• The \(t/k\)-diagnosability of \(m\)-ary \(n\)-cube networks
• The non-inclusion diagnosability of hypercubes under the PMC model
• Title not available (Why is that?)
• The non-inclusive diagnosability of regular graphs
• Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
• Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model
• A graph theory-based approach to the description of the process and the diagnostic system
• Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems
• Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model
• A fault identification algorithm for satellite networks based on system level diagnosis

This page was built for publication: A diagnosis algorithm by using graph-coloring under the PMC model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326504)