Solvability of Peg Solitaire on Graphs is NP-Complete.
Kazushi ItoYasuhiko TakenagaPublished in: IEICE Trans. Inf. Syst. (2023)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- np hard
- randomly generated
- satisfiability problem
- integer programming
- computational complexity
- graph theoretic
- graph matching
- conjunctive queries
- constraint satisfaction problems
- np complete problems
- directed graph
- graph theory
- graph model
- pspace complete
- graph representation
- graph mining
- spanning tree
- graph databases
- data complexity
- graph structures
- weighted graph
- search space
- series parallel
- phase transition
- relational databases