On the public citation graph

Fault‐tolerant cycle embedding in hierarchical cubic networks

https://doi.org/10.1002/net.10101
0 signed · 29 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.10040openalex-snapshot
Node‐disjoint paths and related problems on hierarchical cubic networks
inferredcites →https://doi.org/10.1002/net.3230230207openalex-snapshot
Edge fault tolerance in graphs
inferredcites →https://doi.org/10.1006/jpdc.2000.1681openalex-snapshot
Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links
inferredcites →https://doi.org/10.1007/s00224-001-1021-7openalex-snapshot
Hamiltonicity of the Hierarchical Cubic Network
inferredcites →https://doi.org/10.1016/0020-0190(96)00114-7openalex-snapshot
Embedding a ring in a hypercube with both faulty links and faulty nodes
inferredcites →https://doi.org/10.1016/1383-7621(96)00019-7openalex-snapshot
Topological properties of hierarchical cubic networks
inferredcites →https://doi.org/10.1109/12.260637openalex-snapshot
Fault-tolerant ring embedding in de Bruijn networks
inferredcites →https://doi.org/10.1109/12.565593openalex-snapshot
Distributed ring embedding in faulty De Bruijn networks
inferredcites →https://doi.org/10.1109/71.372797openalex-snapshot
Hierarchical cubic networks
inferredcites →https://doi.org/10.1109/71.395400openalex-snapshot
Algorithms and properties of a new two-level network with folded hypercubes as basic modules
inferredcites →https://doi.org/10.1109/71.640010openalex-snapshot
Fault-tolerant ring embedding in a star graph with both link and node failures
inferredcites →https://doi.org/10.1109/71.667900openalex-snapshot
Comments on "Hierarchical cubic networks"
inferredcites →https://doi.org/10.1109/71.755822openalex-snapshot
Fault-free Hamiltonian cycles in faulty arrangement graphs
inferredcites →https://doi.org/10.1109/71.80187openalex-snapshot
Properties and performance of folded hypercubes
inferredcites →https://doi.org/10.1109/ftcs.1992.243602openalex-snapshot
Optimal ring embedding in hypercubes with faulty links
inferredcites →https://doi.org/10.1109/icpp.1998.708473openalex-snapshot
Embed longest rings onto star graphs with vertex faults
inferredcites →https://doi.org/10.1109/spdp.1994.346157openalex-snapshot
Embedding rings in recursive networks
inferredcites →https://doi.org/10.1109/tc.1987.5009493openalex-snapshot
Processor Allocation in an N-Cube Multiprocessor Using Gray Codes
inferredcites →https://doi.org/10.1145/141914.990672openalex-snapshot
Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)

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-30566-8_16openalex-snapshot
Fault-Tolerant Cycle Embedding in the WK-Recursive Network
inferred← citeshttps://doi.org/10.1007/s11227-008-0232-yopenalex-snapshot
Embedding fault-free cycles in crossed cubes with conditional link faults
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.09.010openalex-snapshot
Subversion analyses of hierarchical networks based on (edge) neighbor connectivity
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.030openalex-snapshot
On conditional fault tolerance and diagnosability of hierarchical cubic networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.028openalex-snapshot
On g-extra conditional diagnosability of hierarchical cubic networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxw078openalex-snapshot
Reliability of Complete Cubic Networks under the Condition ofg-Good-Neighbor
inferred← citeshttps://doi.org/10.1109/tpds.2005.109openalex-snapshot
Hamiltonicity of the WK-recursive network with and without faulty nodes
inferred← citeshttps://doi.org/10.1142/s0129054123500156openalex-snapshot
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks
inferred← citeshttps://doi.org/10.1155/2011/189434openalex-snapshot
Topological Properties of Hierarchical Interconnection Networks: A Review and Comparison
inferred← citeshttps://doi.org/10.3745/kipsta.2007.14-a.6.327openalex-snapshot
Embedding Algorithm between [ 22n-k×2k] Torus and HFN(n,n), HCN(n,n)
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.