On the public citation graph
(t; k)-Diagnosis for matching composition networks
0 signed · 70 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.1995.1046openalex-snapshot
A Linear Time Algorithm for Sequential Diagnosis in Hypercubes
inferredcites →https://doi.org/10.1007/978-1-4684-5511-3_21openalex-snapshot
System-Level Diagnosis: A Perspective for the Third Decade
inferredcites →https://doi.org/10.1016/0012-365x(76)90058-3openalex-snapshot
A note on the edges of the n-cube
inferredcites →https://doi.org/10.1016/0045-7906(95)00028-3openalex-snapshot
Sequential diagnosability of star graphs
inferredcites →https://doi.org/10.1109/12.102840openalex-snapshot
A variation on the hypercube with lower diameter
inferredcites →https://doi.org/10.1109/12.177309openalex-snapshot
On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
inferredcites →https://doi.org/10.1109/12.312114openalex-snapshot
Diagnosability of enhanced hypercubes
inferredcites →https://doi.org/10.1109/12.559801openalex-snapshot
A graph partitioning approach to sequential diagnosis
inferredcites →https://doi.org/10.1109/12.73595openalex-snapshot
Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy
inferredcites →https://doi.org/10.1109/12.817401openalex-snapshot
Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model
inferredcites →https://doi.org/10.1109/pgec.1967.264748openalex-snapshot
On the Connection Assignment Problem of Diagnosable Systems
inferredcites →https://doi.org/10.1109/t-c.1974.223782openalex-snapshot
Characterization of Connection Assignment of Diagnosable Systems
inferredcites →https://doi.org/10.1109/tc.1978.1674966openalex-snapshot
On the Computational Complexity of System Diagnosis
inferredcites →https://doi.org/10.1109/tc.1981.1675844openalex-snapshot
Fault Diagnosis in a Boolean n Cube Array of Microprocessors
inferredcites →https://doi.org/10.1109/tc.1984.1676472openalex-snapshot
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
inferredcites →https://doi.org/10.1109/tc.1987.1676938openalex-snapshot
A Generalized Theory for System Level Diagnosis
inferredcites →https://doi.org/10.1109/tc.2003.1214345openalex-snapshot
(t, k)-diagnosable system: a generalization of the pmc models
inferredcites →https://doi.org/10.1109/tc.2004.114openalex-snapshot
Diagnosability of t-connected networks and product networks under the comparison diagnosis model
inferredcites →https://doi.org/10.1109/tc.2004.50openalex-snapshot
The diagnosability of the matching composition network under the comparison diagnosis model
inferredcites →https://doi.org/10.1109/tc.2005.19openalex-snapshot
Conditional diagnosability measures for large multiprocessor systems
inferredcites →https://doi.org/10.1109/tpds.2002.1019858openalex-snapshot
Diagnosability of crossed cubes under the comparison diagnosis model
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_47openalex-snapshot
Diagnosability of Two-Matching Composition Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_31openalex-snapshot
Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application
inferred← citeshttps://doi.org/10.1007/s00453-016-0210-3openalex-snapshot
Random and Conditional (t, k)-Diagnosis of Hypercubes
inferred← citeshttps://doi.org/10.1007/s11227-011-0620-6openalex-snapshot
A fast pessimistic diagnosis algorithm for generalized hypercube multicomputer systems
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.033openalex-snapshot
The pessimistic diagnosability of three kinds of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.05.015openalex-snapshot
A new locally t -diagnosable structure under the PMC model with an application to matching composition networks
inferred← citeshttps://doi.org/10.1016/j.ins.2006.12.010openalex-snapshot
Embedding meshes into crossed cubes
inferred← citeshttps://doi.org/10.1016/j.ins.2007.05.032openalex-snapshot
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
inferred← citeshttps://doi.org/10.1016/j.ins.2007.08.012openalex-snapshot
Edge-pancyclicity and path-embeddability of bijective connection graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2008.12.023openalex-snapshot
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
inferred← citeshttps://doi.org/10.1016/j.ins.2011.10.022openalex-snapshot
A fast fault-identification algorithm for bijective connection graphs using the PMC model
inferred← citeshttps://doi.org/10.1016/j.ins.2013.01.019openalex-snapshot
Conditional diagnosability of matching composition networks under the MM∗ model
inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105068openalex-snapshot
The (t,k)-diagnosability of Cayley graph generated by 2-tree
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.025openalex-snapshot
The pessimistic diagnosabilities of some general regular graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.035openalex-snapshot
Edge-fault-tolerant strong Menger edge connectivity on regular graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.036openalex-snapshot
Connectivity for some families of composition networks
inferred← citeshttps://doi.org/10.1080/00207160.2015.1020796openalex-snapshot
Theg-extra conditional diagnosability and sequentialt/k-diagnosability of hypercubes
inferred← citeshttps://doi.org/10.1080/17445760.2010.537276openalex-snapshot
Conditional diagnosability of DCCLC graphs under the comparison model
inferred← citeshttps://doi.org/10.1080/23799927.2016.1271015openalex-snapshot
The pessimistic diagnosability of bubble-sort star graphs and augmented k-ary n-cubes
inferred← citeshttps://doi.org/10.1080/23799927.2018.1538163openalex-snapshot
The (t,k) -Diagnosability of Balanced Hypercube under the PMC Model
inferred← citeshttps://doi.org/10.1080/23799927.2019.1625949openalex-snapshot
The ( t, k )-diagnosability of shuffle-cubes under PMC model
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00328openalex-snapshot
t-Diagnosability and Conditional Diagnosability of BCube Networks
inferred← citeshttps://doi.org/10.1109/icist.2012.6221726openalex-snapshot
Analysis of conditional diagnosability for balanced hypercubes
inferred← citeshttps://doi.org/10.1109/tc.2007.1openalex-snapshot
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
inferred← citeshttps://doi.org/10.1109/tc.2007.250624openalex-snapshot
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
inferred← citeshttps://doi.org/10.1109/tc.2008.30openalex-snapshot
Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/tc.2010.16openalex-snapshot
(t, k)-Diagnosability for Regular Networks
inferred← citeshttps://doi.org/10.1109/tc.2010.201openalex-snapshot
(t,k)-Diagnosis for Component-Composition Graphs under the MM* Model
inferred← citeshttps://doi.org/10.1109/tc.2012.58openalex-snapshot
Component-Composition Graphs: (t,k)-Diagnosability and Its Application
inferred← citeshttps://doi.org/10.1109/tc.2014.2345407openalex-snapshot
Conditional (t,k)-Diagnosis in Graphs by Using the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/tdsc.2009.52openalex-snapshot
Diagnosability of Two-Matching Composition Networks under the MM{}^{\ast} Model
inferred← citeshttps://doi.org/10.1109/tdsc.2010.22openalex-snapshot
Determining the Diagnosability of (1,2)-Matching Composition Networks and Its Applications
inferred← citeshttps://doi.org/10.1109/tdsc.2016.2562620openalex-snapshot
Conditional Diagnosability of $(n,k)$ -Star Graphs Under the PMC Model
inferred← citeshttps://doi.org/10.1109/tdsc.2016.2585489openalex-snapshot
Conditional $(t,k)$ -Diagnosis in Regular and Irregular Graphs Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/tnet.2020.3002093openalex-snapshot
Conditional Diagnosability of Alternating Group Networks Under the PMC Model
inferred← citeshttps://doi.org/10.1109/tpds.2008.99openalex-snapshot
The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model
inferred← citeshttps://doi.org/10.1109/tpds.2011.84openalex-snapshot
Conditional ({t}, k)-Diagnosis under the PMC Model
inferred← citeshttps://doi.org/10.1109/tr.2025.3628861openalex-snapshot
Conditional $(t,k)$-Diagnosis of Multiprocessor Systems Based on $g$-Good-Neighbor Fault Pattern
inferred← citeshttps://doi.org/10.1137/06065043xopenalex-snapshot
( t , k )-Diagnosability of Multiprocessor Systems with Applications to Grids and Tori
inferred← citeshttps://doi.org/10.1142/s0219265910002775openalex-snapshot
COMPARISON-BASED CONDITIONAL DIAGNOSABILITY ON THE CLASS OF HYPERCUBE-LIKE NETWORKS
inferred← citeshttps://doi.org/10.1145/2442087.2442091openalex-snapshot
t/t -Diagnosability of regular graphs under the PMC model
inferred← citeshttps://doi.org/10.1145/2611759openalex-snapshot
Diagnosability of Component-Composition Graphs in the MM* Model
inferred← citeshttps://doi.org/10.1145/2699854openalex-snapshot
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC Model
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.