On the public citation graph

A general framework for developing adaptive fault-tolerant routing algorithms

0 signed · 29 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.1007/bf01162967openalex-snapshot
Graph multiplication
inferredcites →https://doi.org/10.1016/0376-5075(79)90032-1openalex-snapshot
Virtual cut-through: A new computer communication switching technique
inferredcites →https://doi.org/10.1109/12.53599openalex-snapshot
Performance analysis of k-ary n-cube interconnection networks
inferredcites →https://doi.org/10.1109/12.61061openalex-snapshot
Adaptive fault-tolerant routing in hypercube multicomputers
inferredcites →https://doi.org/10.1109/12.67315openalex-snapshot
An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
inferredcites →https://doi.org/10.1109/icdcs.1991.148716openalex-snapshot
The hyper-deBruijn multiprocessor networks
inferredcites →https://doi.org/10.1145/2465.2467openalex-snapshot
The cosmic cube
inferredcites →https://doi.org/10.1145/62297.62331openalex-snapshot
Message routing in an injured hypercube
inferredcites →https://doi.org/10.1145/62297.62332openalex-snapshot
Hypercube message routing in the presence of faults
inferredcites →https://doi.org/10.1145/62297.62336openalex-snapshot
A fault-tolerant communication system for the B-Hive generalized hypercube multiprocessor
inferredcites →https://doi.org/10.1145/97444.97707openalex-snapshot
A unified approach to off-line permutation routing on parallel networks
inferredcites →https://doi.org/10.1215/s0012-7094-59-02603-1openalex-snapshot
On the group of the composition of two graphs
inferredcites →https://doi.org/10.1215/s0012-7094-59-02667-5openalex-snapshot
The composition of graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1997.1414openalex-snapshot
The Hyperstar Interconnection Network
inferred← citeshttps://doi.org/10.1016/j.amc.2012.03.092openalex-snapshot
The g-good-neighbor conditional diagnosability of hypercube under PMC model
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.01.003openalex-snapshot
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.11.005openalex-snapshot
A generalized fault-tolerant sorting algorithm on a product network
inferred← citeshttps://doi.org/10.1016/s0895-7177(99)00173-9openalex-snapshot
A finite automata approach to modeling the cross product of interconnection networks
inferred← citeshttps://doi.org/10.1023/a:1019183720873openalex-snapshot
Communication capabilities of product networks
inferred← citeshttps://doi.org/10.1080/10637199808947390openalex-snapshot
UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS
inferred← citeshttps://doi.org/10.1109/12.628392openalex-snapshot
Efficient VLSI layouts for homogeneous product networks
inferred← citeshttps://doi.org/10.1109/71.553283openalex-snapshot
Mesh-connected trees: a bridge between grids and meshes of trees
inferred← citeshttps://doi.org/10.1109/71.640013openalex-snapshot
Generalized algorithm for parallel sorting on product networks
inferred← citeshttps://doi.org/10.1109/71.879775openalex-snapshot
Minimal fault diameter for highly resilient product networks
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380472openalex-snapshot
Design and analysis of product networks
inferred← citeshttps://doi.org/10.1109/ispa.2010.90openalex-snapshot
Super Fault-Tolerant Hamiltonicity of Product Networks
inferred← citeshttps://doi.org/10.1109/tc.2004.114openalex-snapshot
Diagnosability of t-connected networks and product networks under the comparison diagnosis model
inferred← citeshttps://doi.org/10.1109/tc.2008.30openalex-snapshot
Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1109/tpds.2014.2364604openalex-snapshot
Fault-Tolerant Cycle Embedding in Cartesian Product Graphs: Edge-Pancyclicity and Edge-Bipancyclicity with Faulty Edges
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.