On the public citation graph
An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks
0 signed · 36 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.1007/978-1-4419-5906-5_326openalex-snapshot
Perfectly Secure Message Transmission
inferredcites →https://doi.org/10.1007/978-3-322-92106-2openalex-snapshot
Combinatorial Algorithms for Integrated Circuit Layout
inferredcites →https://doi.org/10.1016/s0167-8191(98)00050-7openalex-snapshot
Node-to-set and set-to-set cluster fault tolerant routing in hypercubes
inferredcites →https://doi.org/10.1109/12.599895openalex-snapshot
All-to-all broadcasting in faulty hypercubes
inferredcites →https://doi.org/10.1109/12.61061openalex-snapshot
Adaptive fault-tolerant routing in hypercube multicomputers
inferredcites →https://doi.org/10.1109/12.620486openalex-snapshot
K-pairwise cluster fault tolerant routing in hypercubes
inferredcites →https://doi.org/10.1109/18.212275openalex-snapshot
Distributed algorithms for computing shortest pairs of disjoint paths
inferredcites →https://doi.org/10.1109/49.400667openalex-snapshot
Competitive routing of virtual circuits in ATM networks
inferredcites →https://doi.org/10.1109/gcc.2006.9openalex-snapshot
A Hyper-cube based P2P Information Service for Data Grid
inferredcites →https://doi.org/10.1109/glocom.2006.378openalex-snapshot
OPN04-3: 1+N Protection in Mesh Networks Using Network Coding over p-Cycles
inferredcites →https://doi.org/10.1109/slfstb.1999.777490openalex-snapshot
State-optimal snap-stabilizing PIF in tree networks
inferredcites →https://doi.org/10.1109/tc.2003.1234525openalex-snapshot
Edge disjoint hamiltonian cycles in k-ary n-cubes and hypercubes
inferredcites →https://doi.org/10.1142/s0129626404001982openalex-snapshot
A SOLUTION TO THE THREE DISJOINT PATH PROBLEM ON HONEYCOMB MESHES
inferredcites →https://doi.org/10.1145/138027.138036openalex-snapshot
Perfectly secure message transmission
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.3764openalex-snapshot
An optimal inherently stabilizing routing algorithm for star P2P overlay networks
inferred← citeshttps://doi.org/10.1007/978-3-030-50323-9_12openalex-snapshot
A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks
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-662-44491-7_5openalex-snapshot
A Novel Node-to-Set Node-Disjoint Fault-Tolerant Routing Strategy in Hypercube
inferred← citeshttps://doi.org/10.1007/s10586-024-04582-5openalex-snapshot
Shortest node-to-node disjoint paths algorithm for symmetric networks
inferred← citeshttps://doi.org/10.1007/s11227-025-07454-wopenalex-snapshot
Node-disjoint paths in k-ary n-cube with optimal maximum path length
inferred← citeshttps://doi.org/10.1007/s11276-012-0433-4openalex-snapshot
An evolutionary algorithm for broadcast scheduling in wireless multihop networks
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.1080/17445760.2015.1057587openalex-snapshot
Fault-tolerant routing over shortest node-disjoint paths in hypercubes
inferred← citeshttps://doi.org/10.1093/comjnl/bxag057openalex-snapshot
Fault tolerant communication performance of BCCC data center networks based on disjoint paths
inferred← citeshttps://doi.org/10.1109/candar.2014.46openalex-snapshot
On Hypercube Routing and Fault Tolerance with Bit Constraint
inferred← citeshttps://doi.org/10.1109/icnc.2012.6234600openalex-snapshot
An algorithm for the shortest pairs of arc-disjoint paths problem
inferred← citeshttps://doi.org/10.1109/icnc.2014.6975838openalex-snapshot
Intelligent optimization approach for the k shortest paths problem based on genetic algorithm
inferred← citeshttps://doi.org/10.1109/icsai48974.2019.9010507openalex-snapshot
Machine Learning Driven Network Routing
inferred← citeshttps://doi.org/10.1109/tc.2015.2479614openalex-snapshot
Modeling of Gaussian Network-Based Reconfigurable Network-on-Chip Designs
inferred← citeshttps://doi.org/10.1142/s0129054117500253openalex-snapshot
A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
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.48550/arxiv.2103.09801openalex-snapshot
Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks
inferred← citeshttps://doi.org/10.7763/jacn.2015.v3.138openalex-snapshot
An Optimal Inherently Stabilizing Algorithm for Routing over All Node-Disjoint Paths in Exchanged 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.