1 Page

Shahrokhi,Farhad

Course Number: CGTC 40, Fall 2009

College/University: FAU

Word Count: 246

Rating:

Document Preview

A new look at the tree decomposition Farhad Shahrokhi, UNT, farhad@cs.unt.edu Let G = (V, E) be a graph. We present new algorithms for computing a maximum independent set of G based on a variation of the tree decomposition method. The classical algorithm has O(|V |2k ) time complexity, where |V | is the number of vertices and k is the tree width, or the size of largest bag in a tree decomposition of G. We present...

Unformatted Document Excerpt
Coursehero >> Florida >> FAU >> CGTC 40

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

new A look at the tree decomposition Farhad Shahrokhi, UNT, farhad@cs.unt.edu Let G = (V, E) be a graph. We present new algorithms for computin...
MOST POPULAR MATERIALS FROM CGTC 40
MOST POPULAR MATERIALS FROM CGTC
MOST POPULAR MATERIALS FROM FAU