This preview shows page 1. Sign up to view the full content.
Unformatted text preview: parameter g. The problem is again to find a complete subgraph (clique) of size g, and reports nonexistence. 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 Cliqued 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(V1)? Technically, yes. But not a natural way. Tak...
View
Full
Document
This note was uploaded on 03/01/2010 for the course CS 1234 taught by Professor Chan during the Spring '10 term at University of the BíoBío.
 Spring '10
 Chan

Click to edit the document details