About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 122. Chapters: Tetris, Knapsack problem, Travelling salesman problem, Boolean satisfiability problem, Crossword, SameGame, Hamiltonian path problem, Clique problem, Graph coloring, Exact cover, Sudoku, Quadratic residue, Longest common subsequence problem, List of NP-complete problems, Minesweeper, Nonogram, Dominating set, Vertex cover, Bipartite dimension, Independent set, Slitherlink, Mastermind, Satisfiability Modulo Theories, Maximum cut, Steiner tree problem, Kakuro, Fifteen puzzle, Set cover problem, Partition problem, Feedback vertex set, Maximum coverage problem, Subgraph isomorphism problem, 3-dimensional matching, Longest path problem, Set packing, Nurikabe, Domatic number, Battleship, Unit disk graph, Graph partition, Feedback arc set, Masyu, Generalized assignment problem, Edge dominating set, Route inspection problem, Metric k-center, Vehicle routing problem, Minimum k-cut, Closest string, Karp's 21 NP-complete problems, One-in-three 3SAT, (SAT, -UNSAT), Job-shop problem, Quadrel, Light Up, Hamiltonian completion, Degree-constrained spanning tree, Instant Insanity, Clique cover, Vertex cycle cover, Set splitting problem, Induced subgraph isomorphism problem, Multi-trials technique, Hatena Satena, Maximum common subgraph isomorphism problem, Set TSP problem, Monochromatic triangle, Iterated conditional modes, Shortest total path length spanning tree. Excerpt: In computer science, the clique problem refers to any of the problems related to finding particular complete subgraphs ("cliques") in a graph, i.e., sets of elements where each pair of elements is connected. For example, the maximum clique problem arises in the following real-world setting. Consider a social network, where the graph's vertices represent people, and the graph's edges represent mutual acquaintance. To find a largest subset of people who all know ...
