On the public citation graph
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group
0 signed · 18 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.1007/bfb0040385openalex-snapshot
Simulating binary trees on hypercubes
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.250605openalex-snapshot
Near embeddings of hypercubes into Cayley graphs on the symmetric group
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS
inferredcites →https://doi.org/10.1145/62212.62229openalex-snapshot
Optimal simulations by Butterfly Networks
inferredcites →https://doi.org/10.21236/ada200780openalex-snapshot
Optimal Simulations by 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.1007/3-540-36377-7_2openalex-snapshot
Comparing Star and Pancake Networks
inferred← citeshttps://doi.org/10.1007/3-540-48387-x_16openalex-snapshot
Routing and Embeddings in Super Cayley Graphs
inferred← citeshttps://doi.org/10.1007/s00224-001-1034-2openalex-snapshot
One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00009-3openalex-snapshot
On the problem of sorting burnt pancakes
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00073-5openalex-snapshot
Homomorphisms to powers of digraphs
inferred← citeshttps://doi.org/10.1023/a:1020456931368openalex-snapshot
Construction of Hamiltonian Circuits in Cayley Graphs Modeling Multiprocessing Computer Systems
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.1999.750613openalex-snapshot
Parallel algorithms on the rotation-exchange network-a trivalent variant of the star graph
inferred← citeshttps://doi.org/10.1109/hicss.1995.375503openalex-snapshot
Embedding hypercubes into pancake, cycle prefix and substring reversal networks
inferred← citeshttps://doi.org/10.1109/iccad.1996openalex-snapshot
Proceedings of International Conference on Computer Aided Design
inferred← citeshttps://doi.org/10.1109/icpp.2001.952043openalex-snapshot
A mathematical game and its applications to the design of interconnection networks
inferred← citeshttps://doi.org/10.1109/spdp.1996.570392openalex-snapshot
Proceedings of International Conference on Computer Aided Design
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.