On the public citation graph

Efficient Embeddings of Trees in Hypercubes

0 signed · 96 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.1007/978-3-642-82940-6_5openalex-snapshot

Hypercubes and Pyramids

inferredcites →https://doi.org/10.1007/bf02090766openalex-snapshot

Optimal embeddings of butterfly-like graphs in the hypercube

inferredcites →https://doi.org/10.1007/bf02579202openalex-snapshot

Expanding graphs contain all small trees

inferredcites →https://doi.org/10.1007/bfb0040385openalex-snapshot

Simulating binary trees on hypercubes

inferredcites →https://doi.org/10.1016/0022-0000(84)90071-0openalex-snapshot

A framework for solving VLSI graph layout problems

inferredcites →https://doi.org/10.1016/0743-7315(85)90026-7openalex-snapshot

Embedding of tree networks into hypercubes

inferredcites →https://doi.org/10.1016/0743-7315(87)90002-5openalex-snapshot

Communication efficient basic linear algebra computations on hypercube architectures

inferredcites →https://doi.org/10.1016/0743-7315(87)90018-9openalex-snapshot

On mapping parallel algorithms into parallel architectures

inferredcites →https://doi.org/10.1109/sfcs.1986.38openalex-snapshot

Optimal simulations of tree machines

inferredcites →https://doi.org/10.1109/sfcs.1988.21963openalex-snapshot

Take a walk, grow a tree

inferredcites →https://doi.org/10.1109/tc.1981.1675756openalex-snapshot

On the Mapping Problem

inferredcites →https://doi.org/10.1137/0402014openalex-snapshot

Universal Graphs for Bounded-Degree Trees and Planar Graphs

inferredcites →https://doi.org/10.1145/226643.226658openalex-snapshot

Optimal emulations by butterfly-like networks

inferredcites →https://doi.org/10.1145/72935.72959openalex-snapshot

Dynamic tree embeddings in butterflies and hypercubes

inferredcites →https://doi.org/10.1145/73007.73029openalex-snapshot

Work-preserving emulations of fixed-connection networks

inferredcites →https://doi.org/10.1145/97444.97457openalex-snapshot

Routing multiple paths in hypercubes

inferredcites →https://doi.org/10.1145/97444.97459openalex-snapshot

Fast algorithms for bit-serial routing on a hypercube

inferredcites →https://doi.org/10.1147/rd.381.0031openalex-snapshot

Embedding hyperpyramids into hypercubes

inferredcites →https://doi.org/10.21136/cpm.1973.117800openalex-snapshot

Embedding the polytomic tree into the $n$-cube

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(199901)33:1<71::aid-net5>3.0.co;2-3openalex-snapshot

Small congestion embedding of graphs into hypercubes

inferred← citeshttps://doi.org/10.1002/jgt.22175openalex-snapshot

Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube

inferred← citeshttps://doi.org/10.1002/net.3230240604openalex-snapshot

Compressing grids into small hypercubes

inferred← citeshttps://doi.org/10.1006/jagm.1996.0018openalex-snapshot

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

inferred← citeshttps://doi.org/10.1006/jagm.2002.1217openalex-snapshot

Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes

inferred← citeshttps://doi.org/10.1006/jagm.2002.1218openalex-snapshot

Efficient Dynamic Embeddings of Binary Trees into Hypercubes

inferred← citeshttps://doi.org/10.1006/jpdc.1995.1013openalex-snapshot

On Embedding Binary Trees into Hypercubes

inferred← citeshttps://doi.org/10.1006/jpdc.1995.1045openalex-snapshot

Incomplete Hypercubes: Embeddings of Tree-Related Networks

inferred← citeshttps://doi.org/10.1006/jpdc.1996.0073openalex-snapshot

Embedding Large Complete Binary Trees in Hypercubes with Load Balancing

inferred← citeshttps://doi.org/10.1006/jpdc.1996.0097openalex-snapshot

Embedding Pyramids into 3D Meshes

inferred← citeshttps://doi.org/10.1006/jpdc.1997.1418openalex-snapshot

O(log logN) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1464openalex-snapshot

Embedding ofk-ary Complete Trees into Hypercubes with Uniform Load

inferred← citeshttps://doi.org/10.1006/jpdc.2001.1734openalex-snapshot

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes

inferred← citeshttps://doi.org/10.1007/0-387-27705-6_1openalex-snapshot

Changing Challenges for Collaborative Algorithmics

inferred← citeshttps://doi.org/10.1007/10692760_20openalex-snapshot

Improved Compressions of Cube-Connected Cycles Networks

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-60922-9_14openalex-snapshot

Embedding graphs with bounded treewidth into optimal hypercubes

inferred← citeshttps://doi.org/10.1007/3-540-61626-8_29openalex-snapshot

A general method for efficient embeddings of graphs into optimal hypercubes

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-319-99996-8_7openalex-snapshot

On Transforming Unit Cube into Tree by One-Point Mutation

inferred← citeshttps://doi.org/10.1007/978-3-322-91230-5_2openalex-snapshot

Effiziente Einbettungen baumartiger Graphen in den Hyperwürfel

inferred← citeshttps://doi.org/10.1007/bf01187092openalex-snapshot

An approach to emulating separable graphs

inferred← citeshttps://doi.org/10.1007/bf01940645openalex-snapshot

A New combinatorial approach to optimal embeddings of rectangles

inferred← citeshttps://doi.org/10.1007/bf02090766openalex-snapshot

Optimal embeddings of butterfly-like graphs in the hypercube

inferred← citeshttps://doi.org/10.1007/bfb0015237openalex-snapshot

Efficient use of parallel & distributed systems: From theory to practice

inferred← citeshttps://doi.org/10.1007/bfb0015437openalex-snapshot

Embeddings of hyper-rings in hypercubes

inferred← citeshttps://doi.org/10.1007/bfb0030119openalex-snapshot

Efficient dynamic embedding of arbitrary binary trees into hypercubes

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/0020-0190(96)00045-2openalex-snapshot

A probably optimal embedding of hyper-rings in hypercubes

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.1016/0166-218x(95)00078-6openalex-snapshot

Embedding trees in recursive circulants

inferred← citeshttps://doi.org/10.1016/b978-1-4832-0772-8.50008-xopenalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.007openalex-snapshot

Wirelength of hypercubes into certain trees

inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.024openalex-snapshot

Separator-based graph embedding into multidimensional grids with small edge-congestion

inferred← citeshttps://doi.org/10.1016/j.disopt.2015.03.001openalex-snapshot

Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees

inferred← citeshttps://doi.org/10.1016/j.ins.2021.12.117openalex-snapshot

On some similarity of finite sets (and what we can say today about certain old problem)

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.026openalex-snapshot

Embedding multidimensional grids into optimal hypercubes

inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00101-7openalex-snapshot

Embedding ladders and caterpillars into the hypercube

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00176-6openalex-snapshot

Recursive circulants and their embeddings among hypercubes

inferred← citeshttps://doi.org/10.1016/s0898-1221(97)90055-9openalex-snapshot

Parallel algorithms for regular architectures: Meshes and pyramids

inferred← citeshttps://doi.org/10.1016/s1383-7621(01)00004-2openalex-snapshot

Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube

inferred← citeshttps://doi.org/10.1023/a:1026235604866openalex-snapshot

An Augmented k-ary Tree Multiprocessor with Real-Time Fault-Tolerant Capability

inferred← citeshttps://doi.org/10.1049/ip-cdt:19982341openalex-snapshot

Embedding incomplete binary trees into incomplete hypercubes

inferred← citeshttps://doi.org/10.1080/00207169808804707openalex-snapshot

Embedding meshes in hypercubes with edge faults

inferred← citeshttps://doi.org/10.1080/02286203.2007.11442408openalex-snapshot

Virtual Net: An Efficient Simulation for Parallel Computation

inferred← citeshttps://doi.org/10.1080/23799927.2016.1181671openalex-snapshot

Certain height-balanced subtrees of hypercubes

inferred← citeshttps://doi.org/10.1090/memo/1534openalex-snapshot

Hamiltonicity of Random Subgraphs of the Hypercube

inferred← citeshttps://doi.org/10.1093/comjnl/46.6.632openalex-snapshot

Efficient Embeddings into Hypercube-like Topologies

inferred← citeshttps://doi.org/10.1109/12.392850openalex-snapshot

Embedding binary trees into crossed cubes

inferred← citeshttps://doi.org/10.1109/12.485371openalex-snapshot

Embedding star networks into hypercubes

inferred← citeshttps://doi.org/10.1109/12.494105openalex-snapshot

Embedding an arbitrary binary tree into the star graph

inferred← citeshttps://doi.org/10.1109/12.609277openalex-snapshot

On embedding between 2D meshes of the same size

inferred← citeshttps://doi.org/10.1109/71.536941openalex-snapshot

Embedding classical communication topologies in the scalable OPAM architecture

inferred← citeshttps://doi.org/10.1109/71.706051openalex-snapshot

Improved compressions of cube-connected cycles networks

inferred← citeshttps://doi.org/10.1109/candar.2015.59openalex-snapshot

Bounding Dilation and Edge-Congestion of Separator-Based Graph Embeddings into Grids

inferred← citeshttps://doi.org/10.1109/fie58773.2023.10342977openalex-snapshot

Embedding a Problem Graph into Serious Games for Efficient Traversal Through Game Space

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/icdcs.1997.603399openalex-snapshot

Determining the expected load of dynamic tree embeddings in hypercubes

inferred← citeshttps://doi.org/10.1109/ipps.1994.288225openalex-snapshot

A new combinatorial approach to optimal embeddings of rectangles

inferred← citeshttps://doi.org/10.1109/iscas.2009.5118418openalex-snapshot

Separator-based graph embedding into higher-dimensional grids with small congestion

inferred← citeshttps://doi.org/10.1109/mpcs.1994.367085openalex-snapshot

Problems on routing bounded distance assignments in hypercubes

inferred← citeshttps://doi.org/10.1109/spdp.1993.395463openalex-snapshot

Embedding between 2-D meshes of the same size

inferred← citeshttps://doi.org/10.1109/spdp.1995.530746openalex-snapshot

Edge-disjoint embedding of large full binary trees into hypercubes

inferred← citeshttps://doi.org/10.1109/spdp.1996.570390openalex-snapshot

Embedding of k-ary complete trees into hypercubes with optimal load

inferred← citeshttps://doi.org/10.1137/0219037openalex-snapshot

Group Action Graphs and Parallel Architectures

inferred← citeshttps://doi.org/10.1137/1.9781611976465.56openalex-snapshot

Hamiltonicity of random subgraphs of the hypercube

inferred← citeshttps://doi.org/10.1137/s0097539798332464openalex-snapshot

Hamming Codes, Hypercube Embeddings, and Fault Tolerance

inferred← citeshttps://doi.org/10.1142/s0129053399000168openalex-snapshot

SIMULATION OF CYCLES IN THE IEH GRAPH

inferred← citeshttps://doi.org/10.1142/s0129054100000132openalex-snapshot

A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES

inferred← citeshttps://doi.org/10.1145/113379.113394openalex-snapshot

An approach to emulating separable graphs (preliminary version)

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/331697.332338openalex-snapshot

On dynamic tree growing in hypercubes

inferred← citeshttps://doi.org/10.1155/2014/748941openalex-snapshot

On Counting and Embedding a Subclass of Height-Balanced Trees

inferred← citeshttps://doi.org/10.2316/journal.205.2007.2.205-4369openalex-snapshot

VIRTUAL NET: AN EFFICIENT SIMULATION FOR PARALLEL COMPUTATION

inferred← citeshttps://doi.org/10.3745/kipsta.2007.14-a.4.249openalex-snapshot

The Embedding on Postorder Fibonacci Circulant

inferred← citeshttps://doi.org/10.3745/kipsta.2008.15-a.1.27openalex-snapshot

Postorder Fibonacci Circulants

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.