Hypercube embedding heuristics: An evaluation

DOI10.1007/BF01381720zbMATH Open0703.68014OpenAlexW2009551128MaRDI QIDQ916339FDOQ916339

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

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

Recommendations

• scientific article; zbMATH DE number 19194
• Routing multiple paths in hypercubes
• Hypersphere mapper: A nonlinear programming approach to the hybercube embedding problem
• scientific article; zbMATH DE number 140144
• scientific article; zbMATH DE number 975387

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)

Cites Work

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

Cited In (5)

• On Relaxed Squashed Embedding of Graphs into a Hypercube
• Title not available (Why is that?)
• Hypersphere mapper: A nonlinear programming approach to the hybercube embedding problem
• Partial sum problem mapping into a hypercube
• Genetic algorithm based heuristics for the mapping problem

This page was built for publication: Hypercube embedding heuristics: An evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916339)