In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete...
84 KB (9,905 words) - 11:45, 12 August 2024
given size in a graph (the clique problem) is NP-complete, but despite this hardness result, many algorithms for finding cliques have been studied. Although...
20 KB (2,496 words) - 08:26, 28 December 2023
Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and...
15 KB (1,847 words) - 13:53, 4 August 2024
Independent set (graph theory) (redirect from Independent set problem)
NP-completeness to problems related to independent sets. The independent set problem and the clique problem are complementary: a clique in G is an independent...
29 KB (3,553 words) - 00:07, 29 May 2024
reduction from 3-SAT to the other problem. An example of a problem where this method has been used is the clique problem: given a CNF formula consisting...
52 KB (5,326 words) - 07:49, 3 July 2024
clique problem is the algorithmic problem of distinguishing random graphs from graphs that have a planted clique. This is a variation of the clique problem;...
13 KB (1,680 words) - 09:07, 12 August 2024
Graph theory (redirect from List of problems in graph theory)
certain kind is often an NP-complete problem. For example: Finding the largest complete subgraph is called the clique problem (NP-complete). One special case...
52 KB (6,403 words) - 06:09, 18 June 2024
relating colorings and cliques in those families. For instance, in all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent...
59 KB (7,042 words) - 19:21, 6 May 2024
A clique problem for a class of so-called M-graphs. It is shown that finding an isomorphism for n-vertex graphs is equivalent to finding an n-clique in...
40 KB (4,094 words) - 05:17, 2 August 2024
The Anhui clique (Chinese: 皖系; pinyin: Wǎn Xì) was a military and political organization, one of several mutually hostile cliques or factions that split...
18 KB (1,410 words) - 17:01, 3 August 2024
NP-completeness (redirect from NP-complete problem)
isomorphism problem Subset sum problem Clique problem Vertex cover problem Independent set problem Dominating set problem Graph coloring problem Sudoku To...
30 KB (3,617 words) - 10:32, 8 August 2024
The MaxCliqueDyn algorithm is an algorithm for finding a maximum clique in an undirected graph. MaxCliqueDyn is based on the MaxClique algorithm, which...
10 KB (1,215 words) - 19:21, 14 November 2023
Combinatorial optimization (redirect from NP optimization problem)
Hromkovic's book, all NPO(IV)-problems are excluded from this class unless P=NP. Contains the TSP and clique problem. An NPO problem is called polynomially bounded...
18 KB (1,822 words) - 00:11, 9 June 2024
complement of G. The clique cover problem in computational complexity theory is the algorithmic problem of finding a minimum clique cover, or (rephrased...
8 KB (939 words) - 11:39, 12 August 2024
up clique in Wiktionary, the free dictionary. A clique is a close social group. Clique or The Clique may also refer to: Clique (graph theory) Clique problem...
2 KB (300 words) - 22:32, 16 August 2023
Time complexity (redirect from Polynomial-time problem)
large clique in the union of a clique and a random graph. Although quasi-polynomially solvable, it has been conjectured that the planted clique problem has...
41 KB (4,998 words) - 19:17, 11 August 2024
edges. Variants include the rural postman problem.: ND25, ND27 Clique cover problem: GT17 Clique problem: GT19 Complete coloring, a.k.a. achromatic...
29 KB (2,749 words) - 05:24, 29 July 2024
its description in 1973. Although other algorithms for solving the clique problem have running times that are, in theory, better on inputs that have few...
16 KB (2,128 words) - 19:08, 23 February 2024
Adolescent cliques are cliques that develop amongst adolescents. In the social sciences, the word "clique" is used to describe a group of 3 to 12 "who...
67 KB (8,382 words) - 18:39, 5 August 2024
Graph coloring (redirect from Graph coloring problem)
\omega (G).} For perfect graphs this bound is tight. Finding cliques is known as the clique problem. Hoffman's bound: Let W {\displaystyle W} be a real symmetric...
67 KB (7,996 words) - 03:26, 15 August 2024
be found as an induced subgraph of another. Because it includes the clique problem as a special case, it is NP-complete. Diestel, Reinhard (2006), Graph...
4 KB (513 words) - 11:44, 10 April 2024
The Fengtian clique (Chinese: 奉系军阀; pinyin: Fèngxì Jūnfá; Wade–Giles: Feng-hsi Chün-fa) was the faction that supported warlord Zhang Zuolin during China's...
25 KB (3,012 words) - 06:58, 10 July 2024
Vertex cover (redirect from Vertex cover problem)
reduction from 3-satisfiability or, as Karp did, by reduction from the clique problem. Vertex cover remains NP-complete even in cubic graphs and even in planar...
22 KB (2,554 words) - 12:16, 12 August 2024
bits modulo some odd prime p. The k-clique problem is to decide whether a given graph on n vertices has a clique of size k. For any particular choice...
21 KB (2,565 words) - 22:00, 28 February 2024
Cantor–Bernstein–Schroeder theorem Cayley's formula Cayley's theorem Clique problem (to do) Compactness theorem (very compact proof) Erdős–Ko–Rado theorem...
6 KB (593 words) - 20:11, 5 June 2023
NP-hard problems, including the travelling salesman problem, graph coloring, maximum clique problem, and minimal vertex cover. These problems are only...
3 KB (360 words) - 04:32, 21 April 2024
Set packing (category NP-complete problems)
version (general maximum set packing problem) has been proven as difficult to approximate as the maximum clique problem; in particular, it cannot be approximated...
12 KB (1,519 words) - 09:58, 31 July 2024
Maximal independent set (category Computational problems in graph theory)
A graph may have many maximal cliques, of varying sizes; finding the largest of these is the maximum clique problem. Some authors include maximality...
40 KB (5,451 words) - 01:02, 17 August 2024
traveller problem Cliques and independent sets Clique problem Connected component Cycle space de Bruijn sequences Degree diameter problem Entanglement...
7 KB (664 words) - 12:10, 30 October 2023
hierarchy Clique problem Hamiltonian cycle problem Hamiltonian path problem Integer factorization Knapsack problem Satisfiability problem 2-satisfiability...
5 KB (466 words) - 23:04, 18 April 2024