Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model

DOI10.1109/TC.2008.30MaRDI QIDQ4589585zbMATH OpenFDO

Authors Sun-Yuan Hsieh, Yushu Chen

Publication date 10 November 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cited in

(12)

• On fault identification in interconnection networks under the comparison model
• Diagnosability of star graphs with missing edges
• Conditional diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model
• An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
• A study for conditional diagnosability of pancake graphs
• On the conditional diagnosability of matching composition networks
• On \(g\)-good-neighbor conditional diagnosability of \((n,k)\)-star networks
• A general technique to establish the asymptotic conditional diagnosability of interconnection networks
• Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems
• Random and conditional \((t,k)\)-diagnosis of hypercubes
• Conditional diagnosability of multiprocessor systems based on complete-transposition graphs
• Pancake graphs: structural properties and conditional diagnosability

This page was built for publication: Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model

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