On the public citation graph

Two ranking schemes for efficient computation on the star interconnection network

0 signed · 28 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.1002/net.3230230403openalex-snapshot
Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
inferredcites →https://doi.org/10.1016/0167-8191(93)90054-oopenalex-snapshot
Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
inferredcites →https://doi.org/10.1016/0167-8191(93)90107-vopenalex-snapshot
A novel routing scheme on the star and pancake networks and its applications
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/71.282562openalex-snapshot
A parallel algorithm for computing Fourier transforms on the star graph
inferredcites →https://doi.org/10.1109/spdp.1990.143600openalex-snapshot
Embedding of cycles and grids in star graphs
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1097-0037(200012)36:4<225::aid-net3>3.0.co;2-gopenalex-snapshot
Hamiltonian-laceability of star graphs
inferred← citeshttps://doi.org/10.1007/11572961_41openalex-snapshot
The Star-Pyramid Graph: An Attractive Alternative to the Pyramid
inferred← citeshttps://doi.org/10.1007/s11227-007-0128-2openalex-snapshot
Perfect load balancing on the star interconnection network
inferred← citeshttps://doi.org/10.1016/j.disc.2008.08.007openalex-snapshot
Some topological properties of star graphs: The surface area and volume
inferred← citeshttps://doi.org/10.1016/j.ins.2010.03.029openalex-snapshot
Properties of a hierarchical network based on the star graph
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00133-1openalex-snapshot
VLSI layouts of complete graphs and star graphs
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/s0743-7315(02)00056-4openalex-snapshot
Node-ranking schemes for the star networks
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.1080/03772063.2004.11665483openalex-snapshot
STAR-CUBE: A Special Purpose Interconnection Network for Signal Processing
inferred← citeshttps://doi.org/10.1109/71.605767openalex-snapshot
Matrix decomposition on the star graph
inferred← citeshttps://doi.org/10.1109/71.707542openalex-snapshot
Embedding torus on the star graph
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/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/fmpc.1999.750613openalex-snapshot
Parallel algorithms on the rotation-exchange network-a trivalent variant of the star graph
inferred← citeshttps://doi.org/10.1109/hipc.1996.565815openalex-snapshot
Congestion-free dilation-2 embedding of full binary trees on star graphs
inferred← citeshttps://doi.org/10.1109/icpp.1998.708473openalex-snapshot
Embed longest rings onto star graphs with vertex faults
inferred← citeshttps://doi.org/10.1109/ispan.2005.63openalex-snapshot
On Some Combinatorial Properties of the Star Graph
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
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.