Minor embedding in broken chimera and derived graphs is NP-complete.
Elisabeth LobeAnnette LutzPublished in: Theor. Comput. Sci. (2024)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- randomly generated
- np hard
- graph embedding
- computational complexity
- satisfiability problem
- constraint satisfaction problems
- graph theory
- pspace complete
- graph theoretic
- graph mining
- weighted graph
- directed graph
- data hiding
- vector space
- nonlinear dimensionality reduction
- graph structure
- graph matching
- spectral embedding
- conjunctive queries