On the public citation graph
Optimal embeddings of butterfly-like graphs in the hypercube
0 signed · 53 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/3-540-10291-4_12openalex-snapshot
Issues in the study of graph embeddings
inferredcites →https://doi.org/10.1016/0167-8191(88)90087-7openalex-snapshot
Gray codes, Fast Fourier Transforms and hypercubes
inferredcites →https://doi.org/10.1016/0743-7315(87)90018-9openalex-snapshot
On mapping parallel algorithms into parallel architectures
inferredcites →https://doi.org/10.1016/0898-1221(78)90043-3openalex-snapshot
Combinatorial algorithms: Theory and practice
inferredcites →https://doi.org/10.1109/12.5991openalex-snapshot
On embedding rectangular grids in hypercubes
inferredcites →https://doi.org/10.1137/0221012openalex-snapshot
Efficient Embeddings of Trees in Hypercubes
inferredcites →https://doi.org/10.1145/2157.322401openalex-snapshot
Cost Trade-offs in Graph Embeddings, with Applications
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/62212.62229openalex-snapshot
Optimal simulations by Butterfly Networks
inferredcites →https://doi.org/10.1145/72935.72959openalex-snapshot
Dynamic tree embeddings in butterflies and hypercubes
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.1002/(sici)1097-0037(200003)35:2<161::aid-net7>3.0.co;2-qopenalex-snapshot
Cycles in butterfly graphs
inferred← citeshttps://doi.org/10.1002/net.20039openalex-snapshot
Panconnectivity, fault‐tolerant hamiltonicity and hamiltonian‐connectivity in alternating group graphs
inferred← citeshttps://doi.org/10.1007/0-387-27705-6_1openalex-snapshot
Changing Challenges for Collaborative Algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_30openalex-snapshot
An Intuitive and Effective New Representation for Interconnection Network Structures
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_20openalex-snapshot
Parallel implementations of graph embeddings
inferred← citeshttps://doi.org/10.1007/3-540-56731-3_4openalex-snapshot
Better parallel architectures via emulations
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_244openalex-snapshot
Mapping dynamic data and algorithm structures into product networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-9668-0_28openalex-snapshot
Designing and Using Parallel Architectures
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_13openalex-snapshot
Embeddings of shuffle-like graphs in hypercubes
inferred← citeshttps://doi.org/10.1007/bf01184810openalex-snapshot
Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings
inferred← citeshttps://doi.org/10.1007/bf01187092openalex-snapshot
An approach to emulating separable graphs
inferred← citeshttps://doi.org/10.1007/bf01204731openalex-snapshot
Incomplete hypercubes: Algorithms and embeddings
inferred← citeshttps://doi.org/10.1007/bf02090404openalex-snapshot
Routing multiple paths in hypercubes
inferred← citeshttps://doi.org/10.1007/bf02679453openalex-snapshot
Graph embeddings and simplicial maps
inferred← citeshttps://doi.org/10.1007/s00224-001-1026-2openalex-snapshot
On the Bisection Width and Expansion of Butterfly Networks
inferred← citeshttps://doi.org/10.1007/s002240000098openalex-snapshot
A Tight Layout of the Butterfly Network
inferred← citeshttps://doi.org/10.1007/s11771-002-0010-6openalex-snapshot
An new representation for interconnection network structures
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90152-zopenalex-snapshot
Product-shuffle networks: toward reconciling shuffles and butterflies
inferred← citeshttps://doi.org/10.1109/71.808155openalex-snapshot
Using emulations to enhance the performance of parallel architectures
inferred← citeshttps://doi.org/10.1109/iceidt66693.2025.11473689openalex-snapshot
Enumeration of Metric Bases in Butterfly Networks Using the BIGS Algorithm and Analysis of Beacons Resolving Powers
inferred← citeshttps://doi.org/10.1109/ipps.1998.669902openalex-snapshot
On the bisection width and expansion of butterfly networks
inferred← citeshttps://doi.org/10.1109/ipps.1998.669937openalex-snapshot
Emulating direct products by index-shuffle graphs
inferred← citeshttps://doi.org/10.1109/istcs.1993.253469openalex-snapshot
Hot-potato worm routing is almost as easy as store-and-forward packet routing
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267797openalex-snapshot
On the fault tolerance of some popular bounded-degree networks
inferred← citeshttps://doi.org/10.1137/0219037openalex-snapshot
Group Action Graphs and Parallel Architectures
inferred← citeshttps://doi.org/10.1137/0221012openalex-snapshot
Efficient Embeddings of Trees in Hypercubes
inferred← citeshttps://doi.org/10.1137/0221039openalex-snapshot
Dynamic Tree Embeddings in Butterflies and Hypercubes
inferred← citeshttps://doi.org/10.1137/s0097539793255163openalex-snapshot
On the Fault Tolerance of Some Popular Bounded-Degree Networks
inferred← citeshttps://doi.org/10.1142/s0219265904001258openalex-snapshot
APPROXIMATING HYPERCUBES BY INDEX-SHUFFLE GRAPHS VIA DIRECT-PRODUCT EMULATIONS
inferred← citeshttps://doi.org/10.1145/165231.166110openalex-snapshot
Lower bounds for graph embeddings via algebraic topology
inferred← citeshttps://doi.org/10.1145/174130.174144openalex-snapshot
Taking random walks to grow trees in hypercubes
inferred← citeshttps://doi.org/10.1145/226643.226658openalex-snapshot
Optimal emulations by butterfly-like networks
inferred← citeshttps://doi.org/10.1145/256292.256299openalex-snapshot
Work-preserving emulations of fixed-connection networks
inferred← citeshttps://doi.org/10.1145/97444.97457openalex-snapshot
Routing multiple paths in hypercubes
inferred← citeshttps://doi.org/10.1145/97444.97706openalex-snapshot
On the computational equivalence of hypercube-derived networks
inferred← citeshttps://doi.org/10.21236/ada211915openalex-snapshot
Work-Preserving Emulations of Fixed-Connection 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.