Unformatted text preview: parameter g. The problem is again to find a complete subgraph (clique) of size g, and reports non-existence. Note that 3 refers to the degree of the input graph, not the size of the clique. In general, for any constant d > 1, one can define Clique-d to special case of the Clique problem with the input graph restricted to degree at most d. >can I say the normal CLIQUE problem to > be CLIQUE-(|V|-1)? Technically, yes. But not a natural way. Tak...
View Full Document
- Spring '10
- English-language films, Prof. Lam, normal CLIQUE problem