On the public citation graph
Fault-tolerant routing in circulant networks and cycle prefix networks
0 signed · 59 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.3230230707openalex-snapshot
Cycle prefix digraphs for symmetric interconnection networks
inferredcites →https://doi.org/10.1002/scj.4690170803openalex-snapshot
Fault‐tolerant processor interconnection networks
inferredcites →https://doi.org/10.1016/0012-365x(94)00084-vopenalex-snapshot
On the diameter vulnerability of Kautz digraphs
inferredcites →https://doi.org/10.1016/0012-365x(94)90023-xopenalex-snapshot
Determining the hamilton-connectedness of certain vertex-transitive graphs
inferredcites →https://doi.org/10.1016/0012-365x(94)90036-1openalex-snapshot
On the k-diameter of k-regular k-connected graphs
inferredcites →https://doi.org/10.1016/0020-0190(93)90060-mopenalex-snapshot
On the fault-diameter of the star graph
inferredcites →https://doi.org/10.1016/0898-1221(87)90085-xopenalex-snapshot
Fault diameter of interconnection networks
inferredcites →https://doi.org/10.1016/s0012-365x(98)00175-7openalex-snapshot
Rabin numbers of Butterfly networks
inferredcites →https://doi.org/10.1016/s0195-6698(84)80034-7openalex-snapshot
On the Connectivity of Cayley Digraphs
inferredcites →https://doi.org/10.1023/a:1009728720073openalex-snapshot
Generalized Diameters and Rabin Numbers of Networks
inferredcites →https://doi.org/10.1090/dimacs/021/04openalex-snapshot
Restricted routing and wide diameter of the cycle prefix network
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.2194openalex-snapshot
Flip-trees: fault-tolerant graphs with wide containers
inferredcites →https://doi.org/10.1109/12.223681openalex-snapshot
Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
inferredcites →https://doi.org/10.1109/tc.1985.1676633openalex-snapshot
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
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.11650/twjm/1500407056openalex-snapshot
WIDE DIAMETERS OF BUTTERFLY NETWORKS
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.10040openalex-snapshot
Node‐disjoint paths and related problems on hierarchical cubic networks
inferred← citeshttps://doi.org/10.1002/net.20054openalex-snapshot
On the fault-tolerant diameter and wide diameter of ?-connected graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_19openalex-snapshot
Edge Fault-Diameter of Cartesian Product of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25462-8_38openalex-snapshot
Wide Diameter of Generalized Fat Tree
inferred← citeshttps://doi.org/10.1007/s00224-004-1115-0openalex-snapshot
Generalized Diameters of the Mesh of Trees
inferred← citeshttps://doi.org/10.1016/j.aam.2007.04.005openalex-snapshot
The fault-diameter of Cartesian products
inferred← citeshttps://doi.org/10.1016/j.aam.2009.01.005openalex-snapshot
Edge, vertex and mixed fault diameters
inferred← citeshttps://doi.org/10.1016/j.dam.2009.08.013openalex-snapshot
One-to-many node-disjoint paths in (n,k) -star graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.020openalex-snapshot
Mixed fault diameter of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.025openalex-snapshot
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.dam.2015.02.003openalex-snapshot
Topological properties on the diameters of the integer simplex
inferred← citeshttps://doi.org/10.1016/j.disc.2010.04.020openalex-snapshot
Which Faber–Moore–Chen digraphs are Cayley digraphs?
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.09.004openalex-snapshot
The edge fault-diameter of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.11.005openalex-snapshot
Fault diameter of Cartesian product graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.05.010openalex-snapshot
Fault-diameter of Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/j.jpdc.2024.104905openalex-snapshot
The Rabin numbers of enhanced hypercubes
inferred← citeshttps://doi.org/10.1016/j.procs.2015.07.393openalex-snapshot
Combinatorial Properties of Root-fault Hypertrees
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.005openalex-snapshot
The vulnerability of the diameter of the enhanced hypercubes
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00175-7openalex-snapshot
Rabin numbers of Butterfly networks
inferred← citeshttps://doi.org/10.1023/a:1009728720073openalex-snapshot
Generalized Diameters and Rabin Numbers of Networks
inferred← citeshttps://doi.org/10.1109/12.980015openalex-snapshot
Constructing one-to-many disjoint paths in folded hypercubes
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683293openalex-snapshot
Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs
inferred← citeshttps://doi.org/10.1109/icdcsw.2006.51openalex-snapshot
Fault-diameter of generalized Cartesian products
inferred← citeshttps://doi.org/10.1109/icicn59530.2023.10392303openalex-snapshot
The Wide Diameter of Strong Product Graphs of Complete Graphs and any Graphs
inferred← citeshttps://doi.org/10.1109/sc.2016.26openalex-snapshot
Failure Detection and Propagation in HPC systems
inferred← citeshttps://doi.org/10.1142/s0219265917410080openalex-snapshot
Wide Containers in Gaussian Networks
inferred← citeshttps://doi.org/10.1142/s1793830912500024openalex-snapshot
A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
inferred← citeshttps://doi.org/10.11650/tjm.7.2003.1135openalex-snapshot
ON GENERALIZED WIDE DIAMETER OF GRAPHS
inferred← citeshttps://doi.org/10.11650/twjm/1500407056openalex-snapshot
WIDE DIAMETERS OF BUTTERFLY NETWORKS
inferred← citeshttps://doi.org/10.11650/twjm/1500407715openalex-snapshot
ON GENERALIZED k-DIAMETER OF k-REGULAR k-CONNECTED GRAPHS
inferred← citeshttps://doi.org/10.1177/1094342017711505openalex-snapshot
A failure detector for HPC platforms
inferred← citeshttps://doi.org/10.26493/1855-3974.390.1c5openalex-snapshot
Mixed fault diameter of Cartesian graph bundles II
inferred← citeshttps://doi.org/10.3745/kipsta.2005.12a.6.499openalex-snapshot
Analysis of Bisection width and Fault Diameter for Hyper-Star Network HS(2n, n)
inferred← citeshttps://doi.org/10.48550/arxiv.1002.2508openalex-snapshot
Mixed connectivity of Cartesian graph products and bundles
inferred← citeshttps://doi.org/10.48550/arxiv.1212.4670openalex-snapshot
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
inferred← citeshttps://doi.org/10.48550/arxiv.1404.4907openalex-snapshot
Automorphisms of the cycle prefix digraph
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02906openalex-snapshot
The vulnerability of the diameter of enhanced 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.