Hypercube embedding heuristics: An evaluation

DOI10.1007/BF01381720zbMath0703.68014OpenAlexW2009551128MaRDI QIDQ916339

Matthias F. M. Stallmann, Edward F. Gehringer, Woei-Kae Chen

Publication date: 1990

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01381720

zbMATH Keywords

simulated annealinglocal searchgreedy heuristichypercube embeddingmapping problempriority-queue

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) General theory of computer systems (68M01)

Related Items

Genetic algorithm based heuristics for the mapping problem

Cites Work

• Optimization by Simulated Annealing
• Fixed hypercube embedding
• Mapping strategies in message-based multiprocessor systems
• On the complexity of testing a graph for n-cube
• On cubical graphs
• Cluster partitioning approaches to mapping parallel programs onto a hypercube
• Partitioning graphs on message-passing machines by pairwise mincut
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Embedding Trees in a Hypercube is NP-Complete
• The complexity of cubical graphs
• Cost Trade-offs in Graph Embeddings, with Applications
• Efficient Embeddings of Trees in Hypercubes
• An Efficient Heuristic Procedure for Partitioning Graphs