On the public citation graph

An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes

0 signed · 56 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.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
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.620486openalex-snapshot
K-pairwise cluster fault tolerant routing in hypercubes
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/71.262586openalex-snapshot
A comparative study of topological properties of hypercubes and star graphs
inferredcites →https://doi.org/10.1109/icpp.1998.708475openalex-snapshot
Cluster fault tolerant routing in hypercubes
inferredcites →https://doi.org/10.1109/spdp.1990.143599openalex-snapshot
A topological property of hypercubes: node disjoint paths
inferredcites →https://doi.org/10.1109/spdp.1991.218213openalex-snapshot
Three disjoint path paradigms in star networks
inferredcites →https://doi.org/10.1145/1061425.1061430openalex-snapshot
The equivalence of theorem proving and the interconnection 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

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-319-23509-7_6openalex-snapshot
On Solving the Container Problem in a Hypercube with Bit Constraint
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_35openalex-snapshot
On Disjoint Shortest Paths Routing on the Hypercube
inferred← citeshttps://doi.org/10.1007/s11227-010-0538-4openalex-snapshot
Topological properties of folded hyper-star networks
inferred← citeshttps://doi.org/10.1016/j.dam.2012.04.006openalex-snapshot
One-to-many node-disjoint paths of hyper-star networks
inferred← citeshttps://doi.org/10.1016/j.ins.2007.02.035openalex-snapshot
Node-disjoint paths in hierarchical hypercube networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.01.013openalex-snapshot
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.12.005openalex-snapshot
An efficient construction of one-to-many node-disjoint paths in folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.09.004openalex-snapshot
Constructing all shortest node-disjoint paths in torus networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.12.002openalex-snapshot
Optimal construction of node-disjoint shortest paths in folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.09.005openalex-snapshot
Optimal node-disjoint paths in folded hypercubes
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/j.tcs.2012.09.016openalex-snapshot
Node-disjoint paths in a level block of generalized hierarchical completely connected networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.023openalex-snapshot
On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.049openalex-snapshot
Fault tolerance of hypercube like networks: Spanning laceability under edge faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114562openalex-snapshot
Set-to-set disjoint paths in a folded hypercube
inferred← citeshttps://doi.org/10.1016/s0378-2166(03)00049-3openalex-snapshot
A metalinguistic approach to deconstructing the concepts of ‘face’ and ‘politeness’ in Chinese, English and Japanese
inferred← citeshttps://doi.org/10.1080/00207160.2014.940334openalex-snapshot
One-to-one disjoint path covers on multi-dimensional tori
inferred← citeshttps://doi.org/10.1080/00207160802566805openalex-snapshot
Disjoint paths in hypercubes with prescribed origins and lengths
inferred← citeshttps://doi.org/10.1080/23799927.2024.2360981openalex-snapshot
One-to-one node disjoint paths on divide-and-swap cubes
inferred← citeshttps://doi.org/10.1109/access.2020.3032684openalex-snapshot
Pairwise Disjoint Paths Routing in Tori
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/candarw68385.2025.00042openalex-snapshot
Pairwise Disjoint Paths Routing in Bicubes
inferred← citeshttps://doi.org/10.1109/csci.2015.117openalex-snapshot
An Algorithm for k-Pairwise Cluster-Fault-Tolerant Disjoint Paths in a Burnt Pancake Graph
inferred← citeshttps://doi.org/10.1109/cybermatics_2018.2018.00290openalex-snapshot
On the Torus Pairwise Disjoint-Path Routing Problem
inferred← citeshttps://doi.org/10.1109/gpc.workshops.2008.69openalex-snapshot
Constructing Node-Disjoint Paths in Biswapped Networks (BSNs)
inferred← citeshttps://doi.org/10.1109/icnc.2012.25openalex-snapshot
A Faster Algorithm for Finding Disjoint Ordering of Sets
inferred← citeshttps://doi.org/10.1109/icpads.2001.934838openalex-snapshot
Parallel routing in hypercube networks with faulty nodes
inferred← citeshttps://doi.org/10.1109/pdcat.2007.67openalex-snapshot
Two Tree-Based Algorithms for Network Spare Capacity Design
inferred← citeshttps://doi.org/10.1109/pdcat.2007.85openalex-snapshot
Pairwise Disjoint Paths in Pancake Graphs
inferred← citeshttps://doi.org/10.1109/prdc.2002.1185630openalex-snapshot
Fault-tolerant properties of generalized hierarchical completely-connected networks
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/tpami.2005.247openalex-snapshot
Multiple paths extraction in images using a constrained expanded trellis
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.1109/tpds.2024.3445283openalex-snapshot
Paired Many-to-Many 2-Disjoint Path Covers in Meshes
inferred← citeshttps://doi.org/10.1109/wci.2015.7495533openalex-snapshot
Fault-tolerant routing over all shortest node-disjoint paths in hypercube networks
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/s0219265912500028openalex-snapshot
NEARLY OPTIMAL NODE-TO-SET PARALLEL ROUTING IN OTIS NETWORKS
inferred← citeshttps://doi.org/10.12677/pm.2017.74029openalex-snapshot
Node-Disjoint Shortest and Next-to-Shortest Paths in N-Dimensional Hypercube
inferred← citeshttps://doi.org/10.15803/ijnc.3.2_182openalex-snapshot
A Faster Algorithm for Finding Disjoint Ordering of Sets
inferred← citeshttps://doi.org/10.15803/ijnc.5.2_272openalex-snapshot
Hypercube Fault Tolerant Routing with Bit Constraint
inferred← citeshttps://doi.org/10.2991/ijndc.2015.3.4.1openalex-snapshot
A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint
inferred← citeshttps://doi.org/10.3390/s18113912openalex-snapshot
Torus Pairwise Disjoint-Path Routing
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.