Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
9/52<strong>Fast</strong> <strong>Exponential</strong>-<strong>Time</strong> <strong>Algorithms</strong>Independence and ColoringIndependent sets in graphsIndependent SetsDefinition (Independent Set)Let G = (V , E) be a graph. A subset I ⊆ V of vertices of G is anindependent set of G if no two vertices in I are adjacent.Definition (Maximum Independent Set (MIS))Given a graph G = (V , E), compute an maximum independent se<strong>to</strong>f G.abdcfe
Change language