On the public citation graph

K-pairwise cluster fault tolerant routing in hypercubes

0 signed · 50 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/9780470932025.ch5openalex-snapshot
Interconnection Networks
inferredcites →https://doi.org/10.1002/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-11120-4_3openalex-snapshot
Computational Complexity of Combinatorial and Graph-Theoretic Problems
inferredcites →https://doi.org/10.1017/cbo9780511574955.005openalex-snapshot
Interconnection Networks
inferredcites →https://doi.org/10.1093/comjnl/39.1.14openalex-snapshot
An Efficient Algorithm for Node-to-node Routing in Hypercubes with Faulty Clusters
inferredcites →https://doi.org/10.1109/12.192211openalex-snapshot
Combinatorial analysis of the fault-diameter of the n-cube
inferredcites →https://doi.org/10.1109/12.2234openalex-snapshot
Topological properties of hypercubes
inferredcites →https://doi.org/10.1109/12.42131openalex-snapshot
Generalized measures of fault tolerance with application to N-cube networks
inferredcites →https://doi.org/10.1109/71.242151openalex-snapshot
Algorithms and bounds for shortest paths and diameter in faulty hypercubes
inferredcites →https://doi.org/10.1109/spdp.1990.143599openalex-snapshot
A topological property of hypercubes: node disjoint paths
inferredcites →https://doi.org/10.1145/2465.2467openalex-snapshot
The cosmic cube
inferredcites →https://doi.org/10.1145/322203.322207openalex-snapshot
A Polynomial Solution to the Undirected Two Paths Problem
inferredcites →https://doi.org/10.1145/62044.62050openalex-snapshot
Efficient dispersal of information for security, load balancing, and fault tolerance
inferredcites →https://doi.org/10.1215/s0012-7094-68-03523-0openalex-snapshot
On the existence of certain disjoint arcs in graphs
inferredcites →https://doi.org/10.5860/choice.27-4552openalex-snapshot
Algorithmic graph theory

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<83::aid-net7>3.0.co;2-dopenalex-snapshot
Cluster fault-tolerant routing in star graphs
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1632openalex-snapshot
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes
inferred← citeshttps://doi.org/10.1007/11534310_34openalex-snapshot
Broadcast in the Locally k-Subcube-Connected Hypercube Networks with Faulty Tolerance
inferred← citeshttps://doi.org/10.1007/3-540-44863-2_52openalex-snapshot
Fault-Tolerant Routing in Mesh-Connected 2D Tori
inferred← citeshttps://doi.org/10.1007/978-3-030-79728-7_32openalex-snapshot
Assessing the Super $$P_k$$-Connectedness of Crossed Cubes
inferred← citeshttps://doi.org/10.1007/978-3-031-08819-3_26openalex-snapshot
On the Conditional $$P_k$$-connectivity of Hypercube-Based Architectures
inferred← citeshttps://doi.org/10.1007/978-3-031-35836-4_24openalex-snapshot
Vulnerability of the Hypercube Network Based on $$P_2$$-cuts
inferred← citeshttps://doi.org/10.1007/978-3-031-96093-2_27openalex-snapshot
Cluster-Cuts of BCube-Based Data Center Networks
inferred← citeshttps://doi.org/10.1007/s11227-013-1013-9openalex-snapshot
k-pairwise disjoint paths routing in perfect hierarchical hypercubes
inferred← citeshttps://doi.org/10.1007/s11227-022-04494-4openalex-snapshot
Exact assessment of the super $$P_k$$-connectivity for the crossed cube interconnection network
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128397openalex-snapshot
Reliability evaluation for bijection-connected networks based on the super P-connectivity
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.017openalex-snapshot
Cluster connectivity of hypercube-based networks under the super fault-tolerance condition
inferred← citeshttps://doi.org/10.1016/j.parco.2004.07.006openalex-snapshot
n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.027openalex-snapshot
Complexity of pairwise shortest path routing in the grid
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.009openalex-snapshot
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00121-5openalex-snapshot
An efficient algorithm for k-pairwise disjoint paths in star graphs
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00050-7openalex-snapshot
Node-to-set and set-to-set cluster fault tolerant routing in hypercubes
inferred← citeshttps://doi.org/10.1093/comjnl/bxab198openalex-snapshot
Cluster Connectivity And Super Cluster Connectivity Of DQcube
inferred← citeshttps://doi.org/10.1109/12.980015openalex-snapshot
Constructing one-to-many disjoint paths in folded hypercubes
inferred← citeshttps://doi.org/10.1109/71.808128openalex-snapshot
Unicast in hypercubes with large number of faulty nodes
inferred← citeshttps://doi.org/10.1109/access.2022.3197288openalex-snapshot
Set-to-Set Disjoint Paths Problem in Möbius Cubes
inferred← citeshttps://doi.org/10.1109/icpads.1998.741160openalex-snapshot
Routing in hypercubes with large number of faulty nodes
inferred← citeshttps://doi.org/10.1109/icpp.1998.708475openalex-snapshot
Cluster fault tolerant routing in hypercubes
inferred← citeshttps://doi.org/10.1109/icpp.2002.1040860openalex-snapshot
Hypercube network fault tolerance: a probabilistic approach
inferred← citeshttps://doi.org/10.1109/ispan.1994.367147openalex-snapshot
Advanced fault tolerant routing in hypercubes
inferred← citeshttps://doi.org/10.1109/ispan.1997.645127openalex-snapshot
Node-to-node cluster fault tolerant routing in hypercubes
inferred← citeshttps://doi.org/10.1109/ispan.2000.900279openalex-snapshot
Optimal one-to-many disjoint paths in folded hypercubes
inferred← citeshttps://doi.org/10.1109/spdp.1995.530747openalex-snapshot
An efficient algorithm for k-pairwise node disjoint path problem in hypercubes
inferred← citeshttps://doi.org/10.1109/tc.2002.1004592openalex-snapshot
Locally subcube-connected hypercube networks: theoretical analysis and experimental results
inferred← citeshttps://doi.org/10.1109/tc.2010.76openalex-snapshot
An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks
inferred← citeshttps://doi.org/10.1109/tpds.2011.261openalex-snapshot
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications
inferred← citeshttps://doi.org/10.1142/s0219265901000385openalex-snapshot
ROUTING IN HYPERCUBE NETWORKS WITH A CONSTANT FRACTION OF FAULTY NODES
inferred← citeshttps://doi.org/10.1142/s0219265905001290openalex-snapshot
Hypercube Network Fault Tolerance: A Probabilistic Approach
inferred← citeshttps://doi.org/10.3390/s20113286openalex-snapshot
Cluster-Fault Tolerant Routing in a Torus
inferred← citeshttps://doi.org/10.6983/khhykthp.201203.0082openalex-snapshot
Routing Functions-An Effective Technology for Constructing Node-Disjoint Paths in 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.