On the public citation graph

Hypercube embedding heuristics: An evaluation

https://doi.org/10.1007/bf01381720
0 signed · 51 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/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1007/bfb0040385openalex-snapshot
Simulating binary trees on hypercubes
inferredcites →https://doi.org/10.1007/bfb0040388openalex-snapshot
Embedding grids into hypercubes
inferredcites →https://doi.org/10.1016/0020-0190(80)90025-3openalex-snapshot
On the complexity of testing a graph for n-cube
inferredcites →https://doi.org/10.1016/0020-0190(87)90090-1openalex-snapshot
Fixed hypercube embedding
inferredcites →https://doi.org/10.1016/0095-8956(75)90067-2openalex-snapshot
On cubical graphs
inferredcites →https://doi.org/10.1016/0167-8191(87)90026-3openalex-snapshot
New solutions to the mapping problem of parallel systems: The evolution approach
inferredcites →https://doi.org/10.1016/0167-8191(89)90129-4openalex-snapshot
Mapping strategies in message-based multiprocessor systems
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)90018-9openalex-snapshot
On mapping parallel algorithms into parallel architectures
inferredcites →https://doi.org/10.1016/0743-7315(89)90033-6openalex-snapshot
Embedding arbitrary binary trees in a hypercube
inferredcites →https://doi.org/10.1016/0743-7315(90)90004-9openalex-snapshot
Task allocation onto a hypercube by recursive mincut bipartitioning
inferredcites →https://doi.org/10.1016/s0019-9958(85)80012-7openalex-snapshot
The complexity of cubical graphs
inferredcites →https://doi.org/10.1038/scientificamerican0872-76openalex-snapshot
Origins of the Binary Code
inferredcites →https://doi.org/10.1109/12.2234openalex-snapshot
Topological properties of hypercubes
inferredcites →https://doi.org/10.1109/2.74openalex-snapshot
Architecture and applications of the Connection Machine
inferredcites →https://doi.org/10.1109/dac.1982.1585498openalex-snapshot
A Linear-Time Heuristic for Improving Network Partitions
inferredcites →https://doi.org/10.1109/dmcc.1990.556399openalex-snapshot
Local Search Variants for Hypercube Embedding
inferredcites →https://doi.org/10.1109/tc.1981.1675756openalex-snapshot
On the Mapping Problem
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1109/tc.1987.1676925openalex-snapshot
A Mapping Strategy for Parallel Processing
inferredcites →https://doi.org/10.1109/tc.1987.1676984openalex-snapshot
Assignment of Job Modules onto Array Processors
inferredcites →https://doi.org/10.1109/tc.1987.5009494openalex-snapshot
Nearest-Neighbor Mapping of Finite Element Graphs onto Processor Meshes
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/0219038openalex-snapshot
Embedding Trees in a Hypercube is NP-Complete
inferredcites →https://doi.org/10.1145/2157.322401openalex-snapshot
Cost Trade-offs in Graph Embeddings, with Applications
inferredcites →https://doi.org/10.1145/318789.318800openalex-snapshot
One-to-one mapping of process graphs onto a hypercube
inferredcites →https://doi.org/10.1145/325096.325132openalex-snapshot
The directory-based cache coherence protocol for the DASH multiprocessor
inferredcites →https://doi.org/10.1145/62297.62322openalex-snapshot
A graph-oriented mapping strategy for a hypercube
inferredcites →https://doi.org/10.1287/opre.37.6.865openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

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)1096-9128(199903)11:3<155::aid-cpe424>3.0.co;2-xopenalex-snapshot
Simulated annealing task to processor mapping for domain decomposition methods on distributed parallel computers
inferred← citeshttps://doi.org/10.1006/jpdc.1993.1042openalex-snapshot
Embedding All Binary Trees in the Hypercube
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1013openalex-snapshot
On Embedding Binary Trees into Hypercubes
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_32openalex-snapshot
Variable-dilation embeddings of hypercubes into star graphs: Performance metrics, mapping functions, and routing
inferred← citeshttps://doi.org/10.1007/s004220050520openalex-snapshot
K-way neural network graph partitioning with separator vertices
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90062-copenalex-snapshot
A randomized heuristics for the mapping problem: The genetic approach
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00006-aopenalex-snapshot
Mapping molecular dynamics computations on to hypercubes
inferred← citeshttps://doi.org/10.1016/0305-0548(94)p2435-7openalex-snapshot
Genetic algorithm based heuristics for the mapping problem
inferred← citeshttps://doi.org/10.1016/s0045-7906(01)00029-5openalex-snapshot
HARD: A hypercube embedding algorithm for state assignment of finite state machines
inferred← citeshttps://doi.org/10.1016/s1383-7621(96)00052-5openalex-snapshot
Divide-and-conquer mapping of parallel programs onto hypercube computers
inferred← citeshttps://doi.org/10.1023/a:1008171232465openalex-snapshot
An Architecture-Independent Graphical Tool for Automatic Contention-Free Process-to-Processor Mapping
inferred← citeshttps://doi.org/10.1080/00207549508904834openalex-snapshot
A simulated annealing solution to the cell formation problem
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/anziis.1994.396929openalex-snapshot
An effective parallel heuristic algorithm for the mapping problem
inferred← citeshttps://doi.org/10.1109/dmcc.1990.556399openalex-snapshot
Local Search Variants for Hypercube Embedding
inferred← citeshttps://doi.org/10.1109/iccd.1999.808604openalex-snapshot
On state assignment of finite state machines using hypercube embedding approach
inferred← citeshttps://doi.org/10.1109/ipps.1993.262820openalex-snapshot
Hypersphere Mapper: a nonlinear programming approach to the hypercube embedding problem
inferred← citeshttps://doi.org/10.1109/rta.1993.263111openalex-snapshot
Research issues for executing real-time C3 applications on parallel processing systems
inferred← citeshttps://doi.org/10.1109/spdp.1991.218291openalex-snapshot
Embedding all binary trees in the hypercube
inferred← citeshttps://doi.org/10.1109/spdp.1996.570367openalex-snapshot
Average distance and routing algorithms in the star-connected cycles interconnection network
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5510openalex-snapshot
High Performance Software Reconfiguration in the Context of Distributed Systems and Interconnection 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.