solvableInPolynomialTime
14
triples
GPTKB property
Random triples
| Subject | Object |
|---|---|
| gptkb:Maximum_cut_problem | for bipartite graphs |
| gptkb:Maximum_cut_problem | for planar graphs |
| gptkb:Max-Cut_problem | yes (for planar graphs) |
| gptkb:Max-Cut | no |
| gptkb:3-SAT_problem | false |
| gptkb:Longest_path_problem | no (for general graphs) |
| gptkb:Vertex_cover_problem | for bipartite graphs |
| gptkb:Hamiltonian_path_problem | no (general case) |
| gptkb:Longest_path_problem | yes (for directed acyclic graphs) |
| gptkb:Bottleneck_TSP | If edge weights satisfy triangle inequality |
| gptkb:NAE-SAT | for 2-NAE-SAT |
| gptkb:Hamiltonian_path_problem | yes (special cases) |
| gptkb:clique_problem | no (unless P=NP) |
| gptkb:Max-Cut_problem | no (for general graphs) |