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.
48/52<strong>Fast</strong> <strong>Exponential</strong>-<strong>Time</strong> <strong>Algorithms</strong>Treewidth BasedTreewidth Based <strong>Algorithms</strong>Technique for designing exponential-time algorithmsmainly for special graph classesplanar graphs, graphs of maximum degree 3Example : 2 n/6 time algorithm <strong>to</strong> compute a maximumindependent set in graphs of degree at most 3