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]
• Bipartite dimension[4]
• Capacitated minimum spanning tree[5]
• 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.[6]
• Clique problem[2][7]
• Complete coloring, a.k.a. achromatic number[8]
• Domatic number[9]
• Dominating set, a.k.a. domination number[10]

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.[11]

• Bandwidth problem[12]
• Clique cover problem[2][13]
• Rank coloring a.k.a. cycle rank
• Degree-constrained spanning tree[14]
• Exact cover problem. Remains NP-complete for 3-sets. Solvable in polynomial time for 2-sets (this is a matching).[2][15]
• Feedback vertex set[2][16]
• Feedback arc set[2][17]
• Graph homomorphism problem[18]
• Graph coloring[2][19]
• 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.[20]
• Hamiltonian completion[21]
• Hamiltonian path problem, directed and undirected.[2][22]
• Longest path problem[23]
• Maximum bipartite subgraph or (especially with weighted edges) maximum cut.[2][24]
• Maximum independent set[25]
• Maximum Induced path[26]
• Graph intersection number[27]
• Metric dimension of a graph[28]
• Minimum k-cut
• 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[29]
• Pathwidth[30]
• Set cover (also called minimum cover problem) This is equivalent, by transposing the incidence matrix, to the hitting set problem.[2][31]
• Set splitting problem[32]
• Shortest total path length spanning tree[33]
• Slope number two testing[34]
• Treewidth[30]
• Vertex cover[2][35]

• 3-partition problem[36]
• Bin packing problem[37]
• Knapsack problem, quadratic knapsack problem, and several variants[2][38]
• 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.[39]
• Bottleneck traveling salesman[40]
• 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][41]
• Latin squares (The problem of determining if a partially filled square can be completed to form one)
• Numerical 3-dimensional matching[42]
• Partition problem[2][43]
• Quadratic assignment problem[44]
• Solving two-variable quadratic polynomials over the integers.[45] Given positive integers ${\displaystyle \textstyle A,B,C\geq 0}$, find positive integers ${\displaystyle x,y}$ such that ${\displaystyle Ax^{2}+By-C=0}$
• Quadratic programming (NP-hard in some cases, P if convex)
• Subset sum problem[46]

• Closest string[47]
• Longest common subsequence problem over multiple sequences[48]
• The bounded variant of the Post correspondence problem[49]
• Shortest common supersequence[50]
• String-to-string correction problem[51]

• Battleship
• Bulls and Cows, marketed as Master Mind: certain optimisation problems but not the game itself.
• Eternity II
• (Generalized) FreeCell[52]
• Fillomino[53]
• Hashiwokakero[54]
• Heyawake[55]
• (Generalized) Instant Insanity[56]
• Kakuro (Cross Sums)
• Kuromasu (also known as Kurodoko)[57]
• LaserTank [58]
• Lemmings (with a polynomial time limit)[59]
• Light Up[60]
• Masyu[61]
• Minesweeper Consistency Problem[62] (but see Scott, Stege, & van Rooij[63])
• Nimber (or Grundy number) of a directed graph.[64]
• Numberlink
• Nonograms
• Nurikabe
• NxNxN Rubik's Cube (solved optimally)
• SameGame
• (Generalized) Set[65]
• Slither Link on a variety of grids[66][67][68]
• (Generalized) Sudoku[66][69]
• Problems related to Tetris[70]
• Verbal arithmetic

• Berth allocation problem[71]
• Betweenness
• Assembling an optimal Bitcoin block.[72]
• Boolean satisfiability problem (SAT).[2][73] 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.[74]
• Conjunctive Boolean query[75]
• Cyclic ordering
• Circuit satisfiability problem
• Uncapacitated facility location problem
• Flow Shop Scheduling Problem
• Generalized assignment problem
• Upward planarity testing[34]
• Hospitals-and-residents problem with couples
• Some problems related to Job-shop scheduling
• Monochromatic triangle[76]
• Minimum maximal independent set a.k.a. minimum independent dominating set[77]

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

• Maximum common subgraph isomorphism problem[79]
• Minimum degree spanning tree
• Minimum k-spanning tree
• Metric k-center
• Maximum 2-Satisfiability[80]
• Modal logic S5-Satisfiability
• Some problems related to Multiprocessor scheduling
• Maximum volume submatrix – Problem of selecting the best conditioned subset of a larger m x n matrix. This class of problem is associated with Rank revealing QR factorizations and D optimal experimental design.[81]
• Minimal addition chains for sequences.[82] The complexity of minimal addition chains for individual numbers is unknown.[83]
• Non-linear univariate polynomials over GF[2ⁿ], n the length of the input. Indeed, over any GF[qⁿ].
• Open-shop scheduling
• Pathwidth,[30] or, equivalently, interval thickness, and vertex separation number[84]
• Pancake sorting distance problem for strings[85]
• k-Chinese postman
• Subgraph isomorphism problem[86]
• 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.[87]
• Set packing[2][88]
• Serializability of database histories[89]
• Scheduling to minimize weighted completion time
• Sparse approximation
• Block Sorting[90] (Sorting by Block Moves)
• Second order instantiation
• Treewidth[30]
• Testing whether a tree may be represented as Euclidean minimum spanning tree
• Three-dimensional Ising model[91]
• Vehicle routing problem

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

General

• Garey, Michael R.; Johnson, David S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, ISBN 0-7167-1045-5. This book is a classic, developing the theory, then cataloguing many NP-Complete problems.
• Cook, S.A. (1971). "The complexity of theorem proving procedures". Proceedings, Third Annual ACM Symposium on the Theory of Computing, ACM, New York. pp. 151–158. doi:10.1145/800157.805047.
• Karp, Richard M. (1972). "Reducibility among combinatorial problems". In Miller, Raymond E.; Thatcher, James W. (eds.). Complexity of Computer Computations. Plenum. pp. 85–103.CS1 maint: ref=harv (link)
• Dunne, P.E. "An annotated list of selected NP-complete problems". COMP202, Dept. of Computer Science, University of Liverpool. Retrieved 21 June 2008.
• Crescenzi, P.; Kann, V.; Halldórsson, M.; Karpinski, M.; Woeginger, G. "A compendium of NP optimization problems". KTH NADA, Stockholm. Retrieved 21 June 2008.
• Dahlke, K. "NP-complete problems". Math Reference Project. Retrieved 21 June 2008.

Specific problems

• Friedman, E (2002). "Pearl puzzles are NP-complete". Stetson University, DeLand, Florida. Retrieved 21 June 2008.
• Grigoriev, A; Bodlaender, H L (2007). "Algorithms for graphs embeddable with few crossings per edge". Algorithmica. 49 (1): 1–11. CiteSeerX 10.1.1.61.3576. doi:10.1007/s00453-007-0010-x. MR 2344391.CS1 maint: ref=harv (link)
• Hartung, S; Nichterlein, A (2012). How the World Computes. Lecture Notes in Computer Science. 7318. Springer, Berlin, Heidelberg. pp. 283–292. CiteSeerX 10.1.1.377.2077. doi:10.1007/978-3-642-30870-3_29. ISBN 978-3-642-30869-7.
• Holzer, Markus; Ruepp, Oliver (2007). "The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake". Proceedings, 4th International Conference on Fun with Algorithms, LNCS 4475. Springer, Berlin/Heidelberg. pp. 198–212. doi:10.1007/978-3-540-72914-3_18. ISBN 978-3-540-72913-6.CS1 maint: ref=harv (link)
• Kaye, Richard (2000). "Minesweeper is NP-complete". Mathematical Intelligencer. 22 (2): 9–15. doi:10.1007/BF03025367.CS1 maint: ref=harv (link) Further information available online at Richard Kaye's Minesweeper pages.
• Kashiwabara, T.; Fujisawa, T. (1979). "NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph". Proceedings. International Symposium on Circuits and Systems. pp. 657–660.CS1 maint: ref=harv (link)
• Ohtsuki, Tatsuo; Mori, Hajimu; Kuh, Ernest S.; Kashiwabara, Toshinobu; Fujisawa, Toshio (1979). "One-dimensional logic gate assignment and interval graphs". IEEE Transactions on Circuits and Systems. 26 (9): 675–684. doi:10.1109/TCS.1979.1084695.CS1 maint: ref=harv (link)
• Lengauer, Thomas (1981). "Black-white pebbles and graph separation". Acta Informatica. 16 (4): 465–475. doi:10.1007/BF00264496.CS1 maint: ref=harv (link)
• Arnborg, Stefan; Corneil, Derek G.; Proskurowski, Andrzej (1987). "Complexity of finding embeddings in a k-tree". SIAM Journal on Algebraic and Discrete Methods. 8 (2): 277–284. doi:10.1137/0608024.CS1 maint: ref=harv (link)
• Cormode, Graham (2004). "The hardness of the lemmings game, or Oh no, more NP-completeness proofs". Proceedings of Third International Conference on Fun with Algorithms (FUN 2004). pp. 65–76.

• A compendium of NP optimization problems
• Graph of NP-complete Problems