On the public citation graph

https://doi.org/10.2139/ssrn.4608367

0 signed · 32 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.1006/jpdc.2000.1681openalex-extracted
Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links
inferredcites →https://doi.org/10.1007/bf01608486openalex-extracted
Fault-tolerant routing in circulant networks and cycle prefix networks
inferredcites →https://doi.org/10.1007/s12190-022-01794-zopenalex-extracted
Disjoint paths in the enhanced hypercube with a faulty subgraph
inferredcites →https://doi.org/10.1016/0743-7315(90)90066-xopenalex-extracted
Multicast in hypercube multiprocessors
inferredcites →https://doi.org/10.1016/j.amc.2022.127481openalex-extracted
Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
inferredcites →https://doi.org/10.1016/j.dam.2016.09.013openalex-extracted
Many-to-many disjoint paths in hypercubes with faulty vertices
inferredcites →https://doi.org/10.1016/j.dam.2020.04.030openalex-extracted
R3 -connectivity of folded hypercubes
inferredcites →https://doi.org/10.1016/j.dam.2020.09.012openalex-extracted
Reliability measure of multiprocessor system based on enhanced hypercubes
inferredcites →https://doi.org/10.1016/j.ipl.2004.11.005openalex-extracted
Fault diameter of Cartesian product graphs
inferredcites →https://doi.org/10.1016/j.jpdc.2013.12.005openalex-extracted
An efficient construction of one-to-many node-disjoint paths in folded hypercubes
inferredcites →https://doi.org/10.1016/j.jpdc.2016.12.002openalex-extracted
Optimal construction of node-disjoint shortest paths in folded hypercubes
inferredcites →https://doi.org/10.1016/j.jpdc.2019.12.009openalex-extracted
Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes
inferredcites →https://doi.org/10.1016/j.jpdc.2020.09.005openalex-extracted
Optimal node-disjoint paths in folded hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2005.02.010openalex-extracted
Strong Rabin numbers of folded hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2017.07.005openalex-extracted
The vulnerability of the diameter of the enhanced hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2021.07.006openalex-extracted
The t/s-diagnosability and t/s-diagnosis algorithm of folded hypercube under the PMC/MM* model
inferredcites →https://doi.org/10.1016/j.tcs.2023.113855openalex-extracted
Many-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses
inferredcites →https://doi.org/10.1016/s0012-365x(98)00175-7openalex-extracted
Rabin numbers of Butterfly networks
inferredcites →https://doi.org/10.1016/s0096-3003(98)10041-3openalex-extracted
On connectivity of the Cartesian product of two graphs
inferredcites →https://doi.org/10.1023/a:1009728720073openalex-extracted
Generalized Diameters and Rabin Numbers of Networks
inferredcites →https://doi.org/10.1109/12.312114openalex-extracted
Diagnosability of enhanced hypercubes
inferredcites →https://doi.org/10.1109/12.743415openalex-extracted
Fault tolerance properties of pyramid networks
inferredcites →https://doi.org/10.1109/12.76405openalex-extracted
Enhanced hypercubes
inferredcites →https://doi.org/10.1109/12.980015openalex-extracted
Constructing one-to-many disjoint paths in folded hypercubes
inferredcites →https://doi.org/10.1109/71.615436openalex-extracted
Fault diameter of k-ary n-cube networks
inferredcites →https://doi.org/10.1109/71.640011openalex-extracted
Nearly optimal one-to-many parallel routing in star networks
inferredcites →https://doi.org/10.1109/71.80187openalex-extracted
Properties and performance of folded hypercubes
inferredcites →https://doi.org/10.1109/ms.1985.230701openalex-extracted
Multicast Communication on Network Computers
inferredcites →https://doi.org/10.1109/tpds.2011.261openalex-extracted
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications
inferredcites →https://doi.org/10.1109/tpds.2014.2367498openalex-extracted
Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes
inferredcites →https://doi.org/10.1145/62044.62050openalex-extracted
Efficient dispersal of information for security, load balancing, and fault tolerance
inferredcites →https://doi.org/10.11650/twjm/1500407056openalex-extracted
WIDE DIAMETERS OF BUTTERFLY NETWORKS
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.