On the public citation graph
On Minimum Fault-Tolerant Networks
0 signed · 24 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.1002/jgt.3190070115openalex-snapshot
On size Ramsey number of paths, trees, and circuits. I
inferredcites →https://doi.org/10.1002/jgt.3190100111openalex-snapshot
Minimum k ‐hamiltonian graphs, II
inferredcites →https://doi.org/10.1002/net.3230120303openalex-snapshot
An optimal 2‐FT realization of binary symmetric hierarchical tree systems
inferredcites →https://doi.org/10.1002/net.3230190608openalex-snapshot
Designing optimal fault‐tolerant star networks
inferredcites →https://doi.org/10.1007/bf02579202openalex-snapshot
Expanding graphs contain all small trees
inferredcites →https://doi.org/10.1016/0012-365x(88)90189-6openalex-snapshot
Explicit construction of linear sized tolerant networks
inferredcites →https://doi.org/10.1016/0898-1221(75)90037-1openalex-snapshot
On sparse graphs with dense long paths
inferredcites →https://doi.org/10.1109/tc.1976.1674712openalex-snapshot
A Graph Model for Fault-Tolerant Computing Systems
inferredcites →https://doi.org/10.1109/tc.1986.1676678openalex-snapshot
Distributed Recovery in Fault-Tolerant Multiprocessor Networks
inferredcites →https://doi.org/10.4064/cm-29-1-113-117openalex-snapshot
On Hamiltonian properties of powers of special Hamiltonian graphs
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-27798-9_43openalex-snapshot
Fault-Tolerant Meshes with Constant Degree
inferred← citeshttps://doi.org/10.1016/j.aml.2004.11.005openalex-snapshot
A note on edge fault tolerance with respect to hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.014openalex-snapshot
Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.06.005openalex-snapshot
Minimum k -critical bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00225-9openalex-snapshot
Optimal 1-edge fault-tolerant designs for ladders
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.4.935openalex-snapshot
Fault-Tolerant Meshes with Constant Degree
inferred← citeshttps://doi.org/10.1109/71.577263openalex-snapshot
Multiple-edge-fault tolerance with respect to hypercubes
inferred← citeshttps://doi.org/10.1109/hicss.1995.375507openalex-snapshot
Fault-tolerant graphs for hypercubes and tori
inferred← citeshttps://doi.org/10.1109/ispan.1996.509018openalex-snapshot
Fault-tolerant graphs for tori
inferred← citeshttps://doi.org/10.1109/ispan.1997.645090openalex-snapshot
Fault-tolerant hypercubes with small degree
inferred← citeshttps://doi.org/10.1145/777412.777423openalex-snapshot
Optimal fault-tolerant linear arrays
inferred← citeshttps://doi.org/10.37236/8376openalex-snapshot
Largest Component and Node Fault Tolerance for Grids
inferred← citeshttps://doi.org/10.7151/dmgt.2504openalex-snapshot
$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$
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.