On the public citation graph
Node‐disjoint paths and related problems on hierarchical cubic networks
0 signed · 57 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/net.10040openalex-snapshot
Node‐disjoint paths and related problems on hierarchical cubic networks
inferredcites →https://doi.org/10.1006/jpdc.1994.1158openalex-snapshot
Topological Properties of WK-Recursive Networks
inferredcites →https://doi.org/10.1007/bf01608486openalex-snapshot
Fault-tolerant routing in circulant networks and cycle prefix networks
inferredcites →https://doi.org/10.1016/0020-0190(93)90087-popenalex-snapshot
Fault diameter of star graphs
inferredcites →https://doi.org/10.1016/0020-0190(95)00173-5openalex-snapshot
Combinatorial properties of generalized hypercube graphs
inferredcites →https://doi.org/10.1016/0898-1221(87)90085-xopenalex-snapshot
Fault diameter of interconnection networks
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.192211openalex-snapshot
Combinatorial analysis of the fault-diameter of the n-cube
inferredcites →https://doi.org/10.1109/12.641930openalex-snapshot
Optimal parallel routing in star networks
inferredcites →https://doi.org/10.1109/71.615436openalex-snapshot
Fault diameter of k-ary n-cube networks
inferredcites →https://doi.org/10.1109/71.667900openalex-snapshot
Comments on "Hierarchical cubic networks"
inferredcites →https://doi.org/10.1109/71.809576openalex-snapshot
Combinatorial properties of two-level hypernet networks
inferredcites →https://doi.org/10.1109/spdp.1991.218213openalex-snapshot
Three disjoint path paradigms in star networks
inferredcites →https://doi.org/10.1145/62044.62050openalex-snapshot
Efficient dispersal of information for security, load balancing, and fault tolerance
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.10101openalex-snapshot
Fault‐tolerant cycle embedding in hierarchical cubic networks
inferred← citeshttps://doi.org/10.1002/net.20356openalex-snapshot
Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
inferred← citeshttps://doi.org/10.1007/978-981-97-0798-0_3openalex-snapshot
Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing
inferred← citeshttps://doi.org/10.1007/s00224-001-1021-7openalex-snapshot
Hamiltonicity of the Hierarchical Cubic Network
inferred← citeshttps://doi.org/10.1007/s10255-024-1138-zopenalex-snapshot
The Path-Connectivity of Hierarchical Cubic Networks
inferred← citeshttps://doi.org/10.1007/s11227-009-0304-7openalex-snapshot
Construction of vertex-disjoint paths in alternating group networks
inferred← citeshttps://doi.org/10.1007/s11227-014-1152-7openalex-snapshot
The decycling problem in hierarchical cubic networks
inferred← citeshttps://doi.org/10.1007/s11227-023-05256-6openalex-snapshot
Path covers of bubble-sort star graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.09.026openalex-snapshot
The generalized 4-connectivity of hierarchical cubic 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.ins.2007.09.014openalex-snapshot
Constructing vertex–disjoint paths in (n, k)-star graphs
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.2011.03.026openalex-snapshot
ω -wide diameters of enhanced pyramid networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.035openalex-snapshot
One-to-one disjoint path covers on k -ary n -cubes
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.2015.10.030openalex-snapshot
On conditional fault tolerance and diagnosability of hierarchical cubic networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.07.021openalex-snapshot
On conditional fault tolerance 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.1016/j.tcs.2024.114562openalex-snapshot
Set-to-set disjoint paths in a folded hypercube
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.1093/comjnl/bxw078openalex-snapshot
Reliability of Complete Cubic Networks under the Condition ofg-Good-Neighbor
inferred← citeshttps://doi.org/10.1093/comjnl/bxx053openalex-snapshot
The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars
inferred← citeshttps://doi.org/10.1109/access.2020.3032684openalex-snapshot
Pairwise Disjoint Paths Routing in Tori
inferred← citeshttps://doi.org/10.1109/access.2022.3188783openalex-snapshot
Set-to-Set Disjoint Path Routing in Bijective Connection Graphs
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/cse.2014.235openalex-snapshot
Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults
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/icpads.2001.934862openalex-snapshot
Combinatorial properties of hierarchical cubic networks
inferred← citeshttps://doi.org/10.1109/pacrim.2011.6032891openalex-snapshot
Performance comparison of hierarchical interconnection networks
inferred← citeshttps://doi.org/10.1109/tr.2009.2020101openalex-snapshot
Comments on “A Class of Fault-Tolerant Multiprocessor Networks”
inferred← citeshttps://doi.org/10.1142/s0129054123500107openalex-snapshot
The Wide Diameter and Fault Diameter of Exchanged Crossed Cube
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.1142/s0219265915500073openalex-snapshot
Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults
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)
inferred← citeshttps://doi.org/10.3745/kipsta.2010.17a.1.001openalex-snapshot
Fault Diameter of Folded Hyper-Star Interconnection Networks FHS(2n,n)
inferred← citeshttps://doi.org/10.48550/arxiv.1812.00004openalex-snapshot
The $g$-good neighbour diagnosability of hierarchical cubic networks
showing the first 39 of 40 · page through all 40
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.