Deciding whether four perfect matchings can cover the edges of a snark is NP-complete.
Martin SkovieraPeter VarsaPublished in: Theor. Comput. Sci. (2024)
Keyphrases
- np complete
- np hard
- constraint satisfaction problems
- satisfiability problem
- randomly generated
- computational complexity
- edge information
- conjunctive queries
- edge detector
- phase transition
- directed graph
- polynomial time complexity
- branch and bound algorithm
- weighted graph
- information systems
- data complexity
- np complete problems
- database
- constraint satisfaction
- desirable properties
- genetic algorithm
- pspace complete
- polynomially solvable
- conp complete