Clique problem
In computer science, the Clique Problem is an NP-complete problem in complexity theory.A clique (pronounced "click") in a graph is a set of pairwise adjacent vertices. In the example graph in Graph theory, vertices 1, 2 and 5 form a clique.
The clique problem is the optimization problem of finding a clique of maximum size in a graph. The problem is a decision problem, so we wonder in a clique of size k exists in the graph.
- CLIQUE = {<G,K>| G is a graph with clique, size k}
A brute force algorithm to find a clique in a graph is to list all subsets of vertices, V and check each one to see if it forms a clique. The algorithm is polynomial if k is constant, but super-duper polynomial time if k is |V|/2.
Proof
- TODO
If you received it
such person may.html">may.html">may.html">may choose to alternatively give you a replacement
choose to alternatively give you a second opportunity to
WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED, ARE MADE TO YOU AS
LIMITED TO WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A
the exclusion or limitation of consequential damages, so the
may have other legal rights.
INDEMNITY
and its trustees and agents, and any volunteers associated
texts harmless, from all liability, cost and expense, including
following that you do or cause: [1] distribution of this eBook,
or [3] any Defect.
DISTRIBUTION UNDER "PROJECT GUTENBERG-tm"
disk, book or any other medium if you either delete this
or:
[1] Only give exact copies of it. Among other things, this
eBook or this "small print!" statement. You may however,
binary, compressed, mark-up, or proprietary form,
processing or hypertext software, but only so long as
does *not* contain characters other than those
(~), asterisk (*) and underline (_) characters may
author, and additional characters may be used to
no expense into plain ASCII, EBCDIC or equivalent
the case, for instance, with most word processors);
no additional cost, fee or expense, a copy of.
On
wordlookup.net
All is still licensed under the GNU FDL.
It uses material from the wikipedia.
|
|