Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with clique
Search options not deleted
user 174842
A clique is a subset of the vertices of a graph such that every pair of vertices in the subset is connected by an edge.
0
votes
Graph contains two disjoint cliques
Here is the corrected reduction:
Reduction from Clique to 2disjCLIQUEs
The Clique problem asks: Given a graph $G$ and an integer $k$ , does $G$ contain a clique of size $k$? … In $G'$ , $C_1$ is still a clique of size $k_1 = k$ , and $C_2 = \{v_d\}$ is a clique of size $k_2 = 1$ . …
- 25
0
votes
2
answers
35
views
Graph contains two disjoint cliques
A natural candidate is the Clique problem.
Reduction from Clique:
The Clique problem asks: Given a graph $G$ and integer $k$ , does $G$ contain a clique of size $k$? … If $G$ contains a clique of size $k$, then $G'$ contains two disjoint cliques: one of size $k_1$ (the original clique) and one of size $k_2$ (a single vertex not in the clique). …
- 25