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
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
5/52<strong>Fast</strong> <strong>Exponential</strong>-<strong>Time</strong> <strong>Algorithms</strong>Iterative CompressionNotationinput graph G = (V , E)v 1 , v 2 , . . . , v n sequence of the vertices of Gfor all i = 1, 2, . . . , n, V i = {v 1 , v 2 , . . . , v i } and G i = G[V i ]B i maximum independent set of G i , i.e. |B i | = α(G i )A i = V i \ B i
Change language