On the complexity of the embedding problem for hypercube related graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3833876 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- $B$-valuations of graphs
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Distance-preserving subgraphs of hypercubes
- Embedding Trees in a Hypercube is NP-Complete
- Embedding all binary trees in the hypercube
- Factoring a graph in polynomial time
- Fixed hypercube embedding
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- On Factorable Extensions and Subgraphs of Prime Graphs
- On cubical graphs
- Parallel concepts in graph theory
- The complexity of cubical graphs
Cited in
(10)- On embedding of a hypercube in a completely overlapping network
- Embedding of hypercubes into necklace, windmill and snake graphs
- On embedding complete graphs into hypercubes
- Embedding Trees in a Hypercube is NP-Complete
- The complexity of cubical graphs
- A polynomial time approximation scheme for embedding a directed hypergraph on a ring
- High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix
- Weak embeddings of posets to the Boolean lattice
- Fixed hypercube embedding
- scientific article; zbMATH DE number 3972879 (Why is no real title available?)
This page was built for publication: On the complexity of the embedding problem for hypercube related graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801670)
