Fixed hypercube embedding
From MaRDI portal
Publication:1108043
Recommendations
Cites work
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 3725713 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Distance-preserving subgraphs of hypercubes
- On Some Variants of the Bandwidth Minimization Problem
- On the complexity of testing a graph for n-cube
Cited in
(10)- Packing the hypercube
- Hypercube embedding heuristics: An evaluation
- On the complexity of the embedding problem for hypercube related graphs
- The hardness of embedding grids and walls
- Embedding Trees in a Hypercube is NP-Complete
- scientific article; zbMATH DE number 718860 (Why is no real title available?)
- On embedding complete graphs into hypercubes
- Multidimensional binary partitions: distributed data structures for spatial partitioning
- Cover-preserving embeddings of bipartite orders into Boolean lattices
- Cover-preserving order embeddings into Boolean lattices
This page was built for publication: Fixed hypercube embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108043)