On the public citation graph

Incomplete star: an incrementally scalable network based on the star graph

0 signed · 50 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.1016/0012-365x(83)90269-8openalex-snapshot
Hamiltonian circuits in Cayley graphs
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.4611openalex-snapshot
Incomplete hypercubes
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.1142/s0129054197000112openalex-snapshot
Fault Tolerance on Star Graphs
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS

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.8059openalex-snapshot
A recurrence for the surface area of the (n,k)$$ \left(n,k\right) $$‐star graph
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1356openalex-snapshot
Embeddings of Star Graphs into Optical Meshes without Bends
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1414openalex-snapshot
The Hyperstar Interconnection Network
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1538openalex-snapshot
Broadcasting on Incomplete WK-Recursive Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30566-8_117openalex-snapshot
Enhanced-Star: A New Topology Based on the Star Graph
inferred← citeshttps://doi.org/10.1007/978-3-540-69501-1_9openalex-snapshot
Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-13136-3_13openalex-snapshot
An Efficient Circuit–Switched Broadcasting in Star Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-28073-3_5openalex-snapshot
Mstar : A New Two Level Interconnection Network
inferred← citeshttps://doi.org/10.1007/bf01178908openalex-snapshot
IEH graphs
inferred← citeshttps://doi.org/10.1007/bf02947314openalex-snapshot
Study of general incomplete star interconnection networks
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.036openalex-snapshot
On linear layout of bicube and construction of optimal incomplete bicube
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.10.003openalex-snapshot
Optimal broadcasting on incomplete star graph interconnection networks
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/s0167-8191(00)00065-xopenalex-snapshot
Node-disjoint paths in incomplete WK-recursive networks
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00031-5openalex-snapshot
A faster algorithm for solving linear algebraic equations on the star graph
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00154-0openalex-snapshot
Block-cyclic matrix triangulation on the Cartesian product of star graphs
inferred← citeshttps://doi.org/10.1109/12.247843openalex-snapshot
A routing and broadcasting scheme on faulty star graphs
inferred← citeshttps://doi.org/10.1109/12.589231openalex-snapshot
Toward optimal broadcast in a star graph using multiple spanning trees
inferred← citeshttps://doi.org/10.1109/71.382321openalex-snapshot
A well-behaved enumeration of star graphs
inferred← citeshttps://doi.org/10.1109/71.508251openalex-snapshot
Balanced spanning trees in complete and incomplete star graphs
inferred← citeshttps://doi.org/10.1109/71.588608openalex-snapshot
A shortest path routing algorithm for incomplete WK-recursive networks
inferred← citeshttps://doi.org/10.1109/71.605767openalex-snapshot
Matrix decomposition on the star graph
inferred← citeshttps://doi.org/10.1109/71.674318openalex-snapshot
Low expansion packings and embeddings of hypercubes into star graphs: a performance-oriented approach
inferred← citeshttps://doi.org/10.1109/71.730528openalex-snapshot
Macro-star networks: efficient low-degree alternatives to star 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/candar.2015.49openalex-snapshot
Generalized-Star Cube: A New Class of Interconnection Topology for Massively Parallel Systems
inferred← citeshttps://doi.org/10.1109/candar57322.2022.00011openalex-snapshot
A Recurrence for the Surface Area of the ($n, k$)-Star Graph
inferred← citeshttps://doi.org/10.1109/fmpc.1996.558103openalex-snapshot
Macro-star networks: efficient low-degree alternatives to star graphs for large-scale parallel architectures
inferred← citeshttps://doi.org/10.1109/hpc.1997.592124openalex-snapshot
Broadcasting on incomplete star graph interconnection networks
inferred← citeshttps://doi.org/10.1109/icapp.1996.562867openalex-snapshot
Topological properties of incomplete WK-recursive networks
inferred← citeshttps://doi.org/10.1109/icpads.1996.517549openalex-snapshot
A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks
inferred← citeshttps://doi.org/10.1109/icpads.2009.16openalex-snapshot
Routing, Broadcasting, Prefix Sums, and Sorting Algorithms on the Arrangement Graph
inferred← citeshttps://doi.org/10.1109/ipps.1995.395878openalex-snapshot
Broadcasting on the star and pancake interconnection networks
inferred← citeshttps://doi.org/10.1109/iscc.2009.5202231openalex-snapshot
PeerStar: An attractive alternative to existing peer-to-peer topologies
inferred← citeshttps://doi.org/10.1109/ispan.1996.509013openalex-snapshot
Broadcasting on incomplete WK-recursive networks
inferred← citeshttps://doi.org/10.1109/snpd.2008.89openalex-snapshot
Routing in General Incomplete Star Interconnection Network
inferred← citeshttps://doi.org/10.1109/spdp.1994.346143openalex-snapshot
A new family of fixed degree Cayley networks for multiprocessor design
inferred← citeshttps://doi.org/10.1109/spdp.1996.570368openalex-snapshot
Recursive hierarchical swapped networks: versatile interconnection architectures for highly parallel systems
inferred← citeshttps://doi.org/10.1142/s0129054112500116openalex-snapshot
MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS
inferred← citeshttps://doi.org/10.1142/s0129054118500090openalex-snapshot
Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs
inferred← citeshttps://doi.org/10.1142/s0219265901000464openalex-snapshot
HIGHER DIMENSIONAL HONEYCOMB NETWORKS
inferred← citeshttps://doi.org/10.15803/ijnc.6.2_368openalex-snapshot
Routing and Broadcasting Algorithms for Generalized-Star Cube
inferred← citeshttps://doi.org/10.3906/elk-1202-44openalex-snapshot
Star-crossed cube: an alternative to star graph
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.