Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete.
Elisabeth LobeAnnette LutzPublished in: CoRR (2021)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- graph embedding
- randomly generated
- np hard
- constraint satisfaction problems
- open source
- computational complexity
- spectral embedding
- satisfiability problem
- pspace complete
- np complete problems
- graph theoretic
- graph structure
- graph mining
- graph representation
- complex structures
- phase transition
- graph matching
- conjunctive queries
- data hiding
- graph construction
- nonlinear dimensionality reduction
- embedding space
- query evaluation
- vector space
- conp complete
- special case
- data model