<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2009-09-04 06:03:49NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory |
Add to Reading List |
Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome | Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. CookDocID: 1xVkB - View Document |
 | PDF DocumentDocID: 1xkJU - View Document |
 | Graph theory Po-Shen Loh JuneDocID: 1vmTo - View Document |
 | Graph theory Po-Shen Loh JuneDocID: 1vhpu - View Document |
 | Graph theory Po-Shen Loh JuneDocID: 1v8nl - View Document |