List of NP-complete problems

Graphs occur frequently in everyday applications. Examples include biological or social networks, which contain hundreds, thousands and even billions of nodes in some cases (e.g. Facebook or LinkedIn).

• 1-planarity^[1]
• 3-dimensional matching^{[2][3]: SP1}
• Bandwidth problem^[3]: GT40
• Bipartite dimension^[3]: GT18
• Capacitated minimum spanning tree^[3]: ND5
• Route inspection problem (also called Chinese postman problem) for mixed graphs (having both directed and undirected edges). The program is solvable in polynomial time if the graph has all undirected or all directed edges. Variants include the rural postman problem.^{[3]: ND25, ND27}
• Clique cover problem^{[2][3]: GT17}
• Clique problem^{[2][3]: GT19}
• Complete coloring, a.k.a. achromatic number^[3]: GT5
• Cycle rank
• Degree-constrained spanning tree^[3]: ND1
• Domatic number^[3]: GT3
• Dominating set, a.k.a. domination number^[3]: GT2

NP-complete special cases include the edge dominating set problem, i.e., the dominating set problem in line graphs. NP-complete variants include the connected dominating set problem and the maximum leaf spanning tree problem.^[3]: ND2

• Feedback vertex set^{[2][3]: GT7}
• Feedback arc set^{[2][3]: GT8}
• Graph coloring^{[2][3]: GT4}
• Graph homomorphism problem^[3]: GT52
• Graph partition into subgraphs of specific types (triangles, isomorphic subgraphs, Hamiltonian subgraphs, forests, perfect matchings) are known NP-complete. Partition into cliques is the same problem as coloring the complement of the given graph. A related problem is to find a partition that is optimal terms of the number of edges between parts.^{[3]: GT11, GT12, GT13, GT14, GT15, GT16, ND14}
• Grundy number of a directed graph.^[3]: GT56
• Hamiltonian completion^[3]: GT34
• Hamiltonian path problem, directed and undirected.^{[2][3]: GT37, GT38, GT39}
• Induced subgraph isomorphism problem
• Graph intersection number^[3]: GT59
• Longest path problem^[3]: ND29
• Maximum bipartite subgraph or (especially with weighted edges) maximum cut.^{[2][3]: GT25, ND16}
• Maximum common subgraph isomorphism problem^[3]: GT49
• Maximum independent set^[3]: GT20
• Maximum Induced path^[3]: GT23
• Minimum maximal independent set a.k.a. minimum independent dominating set^[4]

NP-complete special cases include the minimum maximal matching problem,^[3]: GT10 which is essentially equal to the edge dominating set problem (see above).

• Metric dimension of a graph^[3]: GT61
• Metric k-center
• Minimum degree spanning tree
• Minimum k-cut
• Minimum k-spanning tree
• Minor testing (checking whether an input graph ${\displaystyle G}$ contains an input graph ${\displaystyle H}$ as a minor); the same holds with topological minors
• Steiner tree, or Minimum spanning tree for a subset of the vertices of a graph.^[2] (The minimum spanning tree for an entire graph is solvable in polynomial time.)
• Modularity maximization^[5]
• Monochromatic triangle^[3]: GT6
• Pathwidth,^[6] or, equivalently, interval thickness, and vertex separation number^[7]
• Rank coloring
• k-Chinese postman
• Shortest total path length spanning tree^[3]: ND3
• Slope number two testing^[8]
• Recognizing string graphs^[9]
• Subgraph isomorphism problem^[3]: GT48
• Treewidth^[6]
• Testing whether a tree may be represented as Euclidean minimum spanning tree
• Vertex cover^{[2][3]: GT1}
• Minimum Wiener connector problem

• 3-partition problem^[3]: SP15
• Bin packing problem^[3]: SR1
• Bottleneck traveling salesman^[3]: ND24
• Uncapacitated facility location problem
• Flow Shop Scheduling Problem
• Generalized assignment problem
• Integer programming. The variant where variables are required to be 0 or 1, called zero-one linear programming, and several other variants are also NP-complete^{[2][3]: MP1}
• Some problems related to job-shop scheduling
• Knapsack problem, quadratic knapsack problem, and several variants^{[2][3]: MP9}
• Some problems related to multiprocessor scheduling
• Numerical 3-dimensional matching^[3]: SP16
• Open-shop scheduling
• Partition problem^{[2][3]: SP12}
• Quadratic assignment problem^[3]: ND43
• Quadratic programming (NP-hard in some cases, P if convex)
• Subset sum problem^[3]: SP13
• Variations on the traveling salesman problem. The problem for graphs is NP-complete if the edge lengths are assumed integers. The problem for points on the plane is NP-complete with the discretized Euclidean metric and rectilinear metric. The problem is known to be NP-hard with the (non-discretized) Euclidean metric.^{[3]: ND22, ND23}

• Closest string^[10]
• Longest common subsequence problem over multiple sequences^[3]: SR10
• The bounded variant of the Post correspondence problem^[3]: SR11
• Shortest common supersequence over multiple sequences^[3]: SR8
• Extension of the string-to-string correction problem^{[11][3]: SR8}

• Bag (Corral)^[12]
• Battleship
• Bulls and Cows, marketed as Master Mind: certain optimisation problems but not the game itself.
• Edge-matching puzzles
• Fillomino^[13]
• (Generalized) FreeCell^[14]
• Goishi Hiroi
• Hashiwokakero^[15]
• Heyawake^[16]
• (Generalized) Instant Insanity^[3]: GP15
• Kakuro (Cross Sums)^[17]
• Kingdomino^[18]
• Kuromasu (also known as Kurodoko)^[19]
• LaserTank^[20]
• Lemmings (with a polynomial time limit)^[21]
• Light Up^[22]
• Mahjong solitaire (with looking below tiles)
• Masyu^[23]
• Minesweeper Consistency Problem^[24] (but see Scott, Stege, & van Rooij^[25])
• Nonograms
• Numberlink
• Nurikabe^[26]
• (Generalized) Pandemic^[27]
• Peg solitaire
• n-Queens completion
• Optimal solution for the N×N×N Rubik's Cube^[28]
• SameGame
• Shakashaka
• Slither Link on a variety of grids^[29][30][31]
• (Generalized) Sudoku^[29][32]
• Tatamibari
• Tentai Show
• Problems related to Tetris^[33]
• Verbal arithmetic

• Berth allocation problem^[34]
• Betweenness
• Assembling an optimal Bitcoin block.^[35]
• Boolean satisfiability problem (SAT).^{[2][3]: LO1} There are many variations that are also NP-complete. An important variant is where each clause has exactly three literals (3SAT), since it is used in the proof of many other NP-completeness results.^{[3]: p. 48}
• Circuit satisfiability problem
• Conjunctive Boolean query^[3]: SR31
• Cyclic ordering^[36]
• Exact cover problem. Remains NP-complete for 3-sets. Solvable in polynomial time for 2-sets (this is a matching).^{[2][3]: SP2}
• Finding the global minimum solution of a Hartree-Fock problem^[37]
• Upward planarity testing^[8]
• Hospitals-and-residents problem with couples
• Knot genus^[38]
• Latin square completion (the problem of determining if a partially filled square can be completed)
• Maximum 2-satisfiability^[3]: LO5
• Maximum volume submatrix – Problem of selecting the best conditioned subset of a larger ${\displaystyle m\times n}$ matrix. This class of problem is associated with Rank revealing QR factorizations and D optimal experimental design.^[39]
• Minimal addition chains for sequences.^[40] The complexity of minimal addition chains for individual numbers is unknown.^[41]
• Modal logic S5-Satisfiability
• Pancake sorting distance problem for strings^[42]
• Solubility of two-variable quadratic polynomials over the integers.^[43] Given positive integers ${\displaystyle \textstyle A,B,C}$, decide existence of positive integers ${\displaystyle x,y}$ such that ${\displaystyle Ax^{2}+By-C=0}$
• By the same article^[43] existence of bounded modular square roots with arbitrarily composite modulus. Given positive integers ${\displaystyle \textstyle A,B,C\geq 0}$, decide existence of an integer ${\displaystyle x\in [0,C]}$ such that ${\displaystyle x^{2}\equiv A{\bmod {B}}}$. The problem remains NP-complete even if a prime factorization of ${\displaystyle B}$ is provided.
• Serializability of database histories^[3]: SR33
• Set cover (also called "minimum cover" problem). This is equivalent, by transposing the incidence matrix, to the hitting set problem.^{[2][3]: SP5, SP8}
• Set packing^{[2][3]: SP3}
• Set splitting problem^[3]: SP4
• Scheduling to minimize weighted completion time
• Block Sorting^[44] (Sorting by Block Moves)
• Sparse approximation
• Variations of the Steiner tree problem. Specifically, with the discretized Euclidean metric, rectilinear metric. The problem is known to be NP-hard with the (non-discretized) Euclidean metric.^[3]: ND13
• Three-dimensional Ising model^[45]

• Existential theory of the reals § Complete problems
• Karp's 21 NP-complete problems
• List of PSPACE-complete problems
• Reduction (complexity)