007 - parameter g. The problem is again to find a complete...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Posted on 15 April 2009 09:49 >Hi Prof. Lam, >Thanks for your explanation! >One other question: Assignment 5, question 1 >Given the graph G=(V,E) >CLIQUE-3 can only handle the problem with clique size k <= 4 (but I know |V| can be more >than 4 actually), can I say the normal CLIQUE problem to be CLIQUE-(|V|-1)? Not sure if I understand your concern. Hope the following might help you. Clique-3 is a special case of the Clique problem: the input is a graph in which every node has at most 3 neighbors, and a
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 &gt; 1, one can define Clique-d to special case of the Clique problem with the input graph restricted to degree at most d. &gt;can I say the normal CLIQUE problem to &gt; be CLIQUE-(|V|-1)? 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ío-Bío.

Ask a homework question - tutors are online