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 answers only
not deleted
user 83244
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.
7
votes
Prove that "Finishing the degree in three years" problem is NP-Complete
Consider an instance $(G,k)$ of the clique problem: deciding whether there is a clique of size $k$ in the graph $G$. … Now we can see there is a clique of size $k$ in $G$ if and only if it is possible to finish the degree in three years. …
- 7,604
2
votes
Given a set of intervals on the real line, find a minimum set of points that "cover" all the...
Your algorithm is correct. Suppose the interval with minimum end time is $[a,b]$, we only need to prove the fact that there is an optimal solution containing the time point $b$. The algorithm's correc …
- 7,604