On the public citation graph

Multiple-edge-fault tolerance with respect to hypercubes

0 signed · 22 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230230207openalex-snapshot
Edge fault tolerance in graphs
inferredcites →https://doi.org/10.1109/12.367998openalex-snapshot
Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes
inferredcites →https://doi.org/10.1109/71.298202openalex-snapshot
Adding multiple-fault tolerance to generalized cube networks
inferredcites →https://doi.org/10.1109/71.80187openalex-snapshot
Properties and performance of folded hypercubes
inferredcites →https://doi.org/10.1137/0406044openalex-snapshot
On Minimum Fault-Tolerant Networks
inferredcites →https://doi.org/10.1142/s0129626494000351openalex-snapshot
1-EDGE FAULT-TOLERANT DESIGNS FOR MESHES

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20213openalex-snapshot
w‐Rabin numbers and strong w‐Rabin numbers of folded hypercubes
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_22openalex-snapshot
Survivable Networks with Bounded Delay: The Edge Failure Case
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.camwa.2005.03.017openalex-snapshot
Applying fault-tolerant solutions of circulant graphs to multidimensional meshes
inferred← citeshttps://doi.org/10.1016/j.dam.2005.04.004openalex-snapshot
Self-spanner 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.1016/s0020-0190(97)00003-3openalex-snapshot
Faithful 1-edge fault tolerant graphs
inferred← citeshttps://doi.org/10.1109/gocict.2014.17openalex-snapshot
Finding Fault-Tolerant Solutions for Complete Bipartite Networks
inferred← citeshttps://doi.org/10.1109/hpcs.2005.15openalex-snapshot
Applying Fault-Tolerant Solutions of Circulant Graphs to Meshes and Hypercubes
inferred← citeshttps://doi.org/10.1109/hpcs.2006.19openalex-snapshot
Designing and Reconfiguring Fault-Tolerant Hypercubes
inferred← citeshttps://doi.org/10.1109/iceec.2004.1374442openalex-snapshot
Designing fault-tolerant meshes and hypercubes using circulant graphs
inferred← citeshttps://doi.org/10.1109/icpads.2001.934875openalex-snapshot
Algebraic expression for extra degree added to hypercube interconnection network in case of multiple edge-faults
inferred← citeshttps://doi.org/10.1145/2002962.2002971openalex-snapshot
Extending a distributed loop network to tolerate node failures
inferred← citeshttps://doi.org/10.1145/2513228.2513310openalex-snapshot
Fault-tolerant circulant digraphs networks
inferred← citeshttps://doi.org/10.5281/zenodo.199646openalex-snapshot
FIGURE 9 in Two new species of Callulina (Amphibia: Anura: Brevicipitidae) from the Nguru Mountains, Tanzania
inferred← citeshttps://doi.org/10.5555/1400549.1400621openalex-snapshot
Fault-tolerance and reconfiguration of circulant graphs and hypercubes
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.