On the public citation graph

The cross product of interconnection networks

0 signed · 121 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.1993.1098openalex-snapshot
Embedding Meshes on the Star Graph
inferredcites →https://doi.org/10.1016/0166-218x(92)90152-zopenalex-snapshot
Product-shuffle networks: toward reconciling shuffles and butterflies
inferredcites →https://doi.org/10.1016/0743-7315(85)90026-7openalex-snapshot
Embedding of tree networks into hypercubes
inferredcites →https://doi.org/10.1016/s0166-218x(97)00100-5openalex-snapshot
Reliable broadcasting in product networks
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.2234openalex-snapshot
Topological properties of hypercubes
inferredcites →https://doi.org/10.1109/12.277296openalex-snapshot
The cost of broadcasting on star graphs and k-ary hypercubes
inferredcites →https://doi.org/10.1109/12.5991openalex-snapshot
On embedding rectangular grids in hypercubes
inferredcites →https://doi.org/10.1109/71.149958openalex-snapshot
Optimal broadcasting on the star graph
inferredcites →https://doi.org/10.1109/71.243525openalex-snapshot
The hyper-deBruijn networks: scalable versatile architecture
inferredcites →https://doi.org/10.1109/71.262586openalex-snapshot
A comparative study of topological properties of hypercubes and star graphs
inferredcites →https://doi.org/10.1109/71.80144openalex-snapshot
The banyan-hypercube networks
inferredcites →https://doi.org/10.1109/fmpc.1992.234949openalex-snapshot
Hyper Petersen network: yet another hypercube-like topology
inferredcites →https://doi.org/10.1109/fmpc.1995.380472openalex-snapshot
Design and analysis of product networks
inferredcites →https://doi.org/10.1109/icpp.1994.73openalex-snapshot
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
inferredcites →https://doi.org/10.1109/spdp.1990.143600openalex-snapshot
Embedding of cycles and grids in star graphs
inferredcites →https://doi.org/10.1109/spdp.1991.218211openalex-snapshot
Data communication and computational geometry on the star and pancake interconnection networks
inferredcites →https://doi.org/10.1109/spdp.1995.530751openalex-snapshot
Reliable broadcasting in product networks in the presence of faulty nodes
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1145/828.322449openalex-snapshot
Graph Problems on a Mesh-Connected Processor Array

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.1006/jpdc.1998.1467openalex-snapshot
Multiple Graph Embeddings into a Processor Array with Spanning Buses
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1770openalex-snapshot
Comparative Study of Product Networks
inferred← citeshttps://doi.org/10.1007/0-306-46964-2_16openalex-snapshot
A Sampler of Other Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-5611-4_40openalex-snapshot
A New Family of Ring-Bisection Networks and Routing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_31openalex-snapshot
The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-33828-6_7openalex-snapshot
Results for Graph Products
inferred← citeshttps://doi.org/10.1007/978-3-642-13136-3_1openalex-snapshot
Efficient Grid on the OTIS-Arrangment Network
inferred← citeshttps://doi.org/10.1007/s10586-011-0189-0openalex-snapshot
A new family of Cayley graph interconnection networks based on wreath product and its topological properties
inferred← citeshttps://doi.org/10.1007/s10878-021-00766-6openalex-snapshot
A note on maximum fractional matchings of graphs
inferred← citeshttps://doi.org/10.1007/s11227-020-03216-yopenalex-snapshot
Optimal low-latency network topologies for cluster performance enhancement
inferred← citeshttps://doi.org/10.1007/s11587-023-00770-4openalex-snapshot
On the spectra of wreath products of circulant graphs
inferred← citeshttps://doi.org/10.1007/s40840-016-0442-zopenalex-snapshot
Proper Connection Number of Graph Products
inferred← citeshttps://doi.org/10.1016/j.amc.2017.03.015openalex-snapshot
Constructing edge-disjoint Steiner paths in lexicographic product networks
inferred← citeshttps://doi.org/10.1016/j.aml.2008.06.030openalex-snapshot
The exponent of Cartesian product of cycles
inferred← citeshttps://doi.org/10.1016/j.aml.2010.12.001openalex-snapshot
The optimal strong radius and optimal strong diameter of the Cartesian product graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.010openalex-snapshot
Connectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105341openalex-snapshot
The g-good-neighbor diagnosability of product networks under the PMC model
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.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.jcss.2024.103552openalex-snapshot
The g-extra connectivity of graph products
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103602openalex-snapshot
Monitoring the edges of product networks using distances
inferred← citeshttps://doi.org/10.1016/j.jnca.2022.103542openalex-snapshot
Flexible, highly scalable and cost-effective network structures for data centers
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.09.010openalex-snapshot
Performance modeling of Cartesian product networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.11.006openalex-snapshot
Higher dimensional Eisenstein–Jacobi networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.050openalex-snapshot
Matching preclusion number in product graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.021openalex-snapshot
Fractional matching preclusion of product networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115904openalex-snapshot
The g-good-neighbor diagnosability of lexicographic product networks under the PMC model
inferred← citeshttps://doi.org/10.1016/s0164-1212(01)00121-2openalex-snapshot
On the attractiveness of the star network
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00439-6openalex-snapshot
Sparsest cuts and concurrent flows in product graphs
inferred← citeshttps://doi.org/10.1016/s0743-7315(02)00056-4openalex-snapshot
Node-ranking schemes for the star networks
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.1016/s1383-7621(02)00063-2openalex-snapshot
Hypermeshes: implementation and performance
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00020-1openalex-snapshot
On the topological properties of the arrangement–star network
inferred← citeshttps://doi.org/10.1023/a:1011140203528openalex-snapshot
On the Performance of Parallel Matrix Factorisation on the Hypermesh
inferred← citeshttps://doi.org/10.1023/a:1019158831409openalex-snapshot
Hybrid graph-based networks for multiprocessing
inferred← citeshttps://doi.org/10.1023/a:1019183720873openalex-snapshot
Communication capabilities of product networks
inferred← citeshttps://doi.org/10.1080/00207160.2014.987762openalex-snapshot
Path-connectivity of lexicographic product graphs
inferred← citeshttps://doi.org/10.1080/00207160.2015.1047356openalex-snapshot
Rainbow vertex-connection and graph products
inferred← citeshttps://doi.org/10.1080/02533839.2026.2649560openalex-snapshot
The structure fault-tolerability analysis of product graphs
inferred← citeshttps://doi.org/10.1080/10637199808947379openalex-snapshot
EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK
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.1080/23799927.2016.1249412openalex-snapshot
Maximally matched and super matched regular graphs
inferred← citeshttps://doi.org/10.1109/71.841743openalex-snapshot
Recursive cube of rings: a new topology for interconnection networks
inferred← citeshttps://doi.org/10.1109/71.879775openalex-snapshot
Minimal fault diameter for highly resilient product networks
inferred← citeshttps://doi.org/10.1109/71.995816openalex-snapshot
Topological properties of OTIS-networks
inferred← citeshttps://doi.org/10.1109/ams.2007.78openalex-snapshot
Parallel Numerical Interpolation on Necklace Hypercubes
inferred← citeshttps://doi.org/10.1109/dictap.2012.6215391openalex-snapshot
Extended OTIS-Arrangment a new efficient interconnection network
inferred← citeshttps://doi.org/10.1109/hpcasia.2005.64openalex-snapshot
Parallel 3-dimensional DCT computation on k-ary n-cubes
inferred← citeshttps://doi.org/10.1109/icmlc.2009.5212231openalex-snapshot
Some properties of Cartesian product of Cayley graphs
inferred← citeshttps://doi.org/10.1109/icpads.1997.652584openalex-snapshot
Optimal embeddings of multiple graphs into a hypermesh
inferred← citeshttps://doi.org/10.1109/icpads.2001.934861openalex-snapshot
On some properties of k-ary n-cubes
inferred← citeshttps://doi.org/10.1109/icpads.2007.4447828openalex-snapshot
Mathematical performance analysis of product networks
inferred← citeshttps://doi.org/10.1109/icycs.2008.285openalex-snapshot
Theoretical Research on Topological Properties of Generalized K-Ary n-Cube Interconnection Network
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00035openalex-snapshot
Edge-Disjoint Spanning Trees on Star Products
inferred← citeshttps://doi.org/10.1109/ispa.2010.90openalex-snapshot
Super Fault-Tolerant Hamiltonicity of Product Networks
inferred← citeshttps://doi.org/10.1109/ispan-fcst-iscc.2017.39openalex-snapshot
Steiner Distance in Join, Corona and Threshold Graphs
inferred← citeshttps://doi.org/10.1109/sysmart.2018.8746958openalex-snapshot
A Routing Algorithm for Proposed Concentric Rings Topological Networks
inferred← citeshttps://doi.org/10.1109/taeece.2013.6557298openalex-snapshot
Hamiltonian Cycle within Extended OTIS-Arrangement network
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.2003.1189580openalex-snapshot
Constructing edge-disjoint spanning trees in product networks
inferred← citeshttps://doi.org/10.1109/tpds.2005.98openalex-snapshot
Performance, algorithmic, and robustness attributes of perfect difference networks
inferred← citeshttps://doi.org/10.1109/tpds.2008.99openalex-snapshot
The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model
inferred← citeshttps://doi.org/10.1109/tpds.2012.304openalex-snapshot
Conditional Edge-Fault Hamiltonicity of Cartesian Product Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2013.103openalex-snapshot
Hamiltonicity of Product Networks with Faulty Elements
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
inferred← citeshttps://doi.org/10.1109/tpds.2015.2504936openalex-snapshot
Higher Dimensional Gaussian Networks
inferred← citeshttps://doi.org/10.1109/wccct60665.2024.10541308openalex-snapshot
Minimum Strong Radius of the Strong Product of Cycles and Odd Paths
inferred← citeshttps://doi.org/10.1142/s0129626419500087openalex-snapshot
A Note on the Steinerk-Diameter of Tensor Product Networks
inferred← citeshttps://doi.org/10.1142/s0219265904001039openalex-snapshot
ON THE COMBINATORIAL PROPERTIES OF k-ARY n-CUBES
inferred← citeshttps://doi.org/10.1142/s0219265916500080openalex-snapshot
Lineark-Arboricity in Product Networks
inferred← citeshttps://doi.org/10.1142/s0219265919500014openalex-snapshot
Proper Vertex Connection and Graph Operations
inferred← citeshttps://doi.org/10.1142/s0219265921500109openalex-snapshot
Strong Equitable Vertex Arboricity in Cartesian Product Networks
inferred← citeshttps://doi.org/10.1142/s0219265925500197openalex-snapshot
On the Distance-Edge-Monitoring Numbers of Strong Product Graphs
inferred← citeshttps://doi.org/10.1142/s1793830916500117openalex-snapshot
Monochromatic connectivity and graph products
inferred← citeshttps://doi.org/10.1145/1066677.1066842openalex-snapshot
The necklace-hypercube
inferred← citeshttps://doi.org/10.14569/ijacsa.2016.070828openalex-snapshot
Efficient Load Balancing Algorithm for the Arrangement-Star Network
inferred← citeshttps://doi.org/10.17485/ijst/2011/v4i12.24openalex-snapshot
STH: A highly scalable and economical topology for massively parallel systems
inferred← citeshttps://doi.org/10.24200/tjer.vol11iss2pp79-88openalex-snapshot
On Directed Edge-Disjoint Spanning Trees in Product Networks, An Algorithmic Approach
inferred← citeshttps://doi.org/10.26493/2590-9770.1216.6d2openalex-snapshot
The k -independence number of graph products
inferred← citeshttps://doi.org/10.35940/ijrte.b1150.0982s1019openalex-snapshot
An Efficient Exchanged Hyper Cube for Parallel and Distributed Network
inferred← citeshttps://doi.org/10.3934/math.2022921openalex-snapshot
Generalized (edge-)connectivity of join, corona and cluster graphs
inferred← citeshttps://doi.org/10.3990/1.978-9036523707openalex-snapshot
Sparse cuts, matching-cuts and leafy trees in graphs
inferred← citeshttps://doi.org/10.3990/1.9789036523707openalex-snapshot
Sparse cuts, matching-cuts and leafy trees in graphs
inferred← citeshttps://doi.org/10.4018/978-1-4666-2065-0.ch014openalex-snapshot
Structural Outlooks for the OTIS-Arrangement Network
inferred← citeshttps://doi.org/10.4018/jghpc.2011040105openalex-snapshot
Structural Outlooks for the OTIS-Arrangement Network
inferred← citeshttps://doi.org/10.46298/dmtcs.1266openalex-snapshot
The generalized 3-connectivity of Lexicographic product graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1838openalex-snapshot
A survey on the generalized connectivity of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1505.02246openalex-snapshot
Proper connection number and graph products
inferred← citeshttps://doi.org/10.48550/arxiv.1508.07202openalex-snapshot
Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04121openalex-snapshot
Line k-Arboricity in Product Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1604.01887openalex-snapshot
Pendant-tree connectivity of line graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1604.06853openalex-snapshot
Adaptive Content-based Routing using Subscription Subgrouping in Structured Overlays
inferred← citeshttps://doi.org/10.48550/arxiv.1604.06862openalex-snapshot
The minimal size of graphs with given pendant-tree connectivity
inferred← citeshttps://doi.org/10.48550/arxiv.1611.08743openalex-snapshot
Eliminating Tight Coupling using Subscriptions Subgrouping in Structured Overlays
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06497openalex-snapshot
Load-balanced Routing for Nested Interconnection Networks
inferred← citeshttps://doi.org/10.5120/ijais12-450817openalex-snapshot
Embeddings on Torus-Butterfly Interconnection Network
inferred← citeshttps://doi.org/10.5539/jmr.v11n2p20openalex-snapshot
Strong Geodetic Number in Some 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.