np-complete-problems

Articles

• Circuit satisfiability problemClassic NP-complete problem in computer science
• Monochromatic triangle
• Generalized assignment problemCombinatorial optimization problem
• Monochromatic triangle
• Hamiltonian completionAdding edges to make a graph Hamiltonian
• Circuit satisfiability problemClassic NP-complete problem in computer science
• Traveling purchaser problemProblem in combinatorial optimization
• Circuit satisfiability problemClassic NP-complete problem in computer science
• Bipartite dimensionSize of biclique cover of a graph
• Betweenness problemAlgorithmic problem in order theory
• Unit disk graphIntersection graph of unit disks in the plane
• Monochromatic triangle
• Circuit satisfiability problemClassic NP-complete problem in computer science
• Unit disk graphIntersection graph of unit disks in the plane
• Monochromatic triangle
• Circuit satisfiability problemClassic NP-complete problem in computer science
• Unit disk graphIntersection graph of unit disks in the plane
• Monochromatic triangle
• Generalized assignment problemCombinatorial optimization problem
• Generalized assignment problemCombinatorial optimization problem
• Generalized assignment problemCombinatorial optimization problem
• Generalized assignment problemCombinatorial optimization problem
• Set splitting problem