Hypercube embedding heuristics: An evaluation
From MaRDI portal
(Redirected from Publication:916339)
Recommendations
Cites work
- An Efficient Heuristic Procedure for Partitioning Graphs
- Cluster partitioning approaches to mapping parallel programs onto a hypercube
- Cost Trade-offs in Graph Embeddings, with Applications
- Efficient Embeddings of Trees in Hypercubes
- Embedding Trees in a Hypercube is NP-Complete
- Fixed hypercube embedding
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Mapping strategies in message-based multiprocessor systems
- On cubical graphs
- On the complexity of testing a graph for n-cube
- Optimization by simulated annealing
- Partitioning graphs on message-passing machines by pairwise mincut
- The complexity of cubical graphs
Cited in
(5)- On Relaxed Squashed Embedding of Graphs into a Hypercube
- scientific article; zbMATH DE number 718860 (Why is no real title available?)
- 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)