<--- Back to Details
First PageDocument Content
Computational complexity theory / Parameterized complexity / Analysis of algorithms / Michael Fellows / Kernelization / Outerplanar graph / Clique / Connectivity / Tree decomposition / Graph theory / Theoretical computer science / Mathematics
Date: 2014-06-09 11:30:44
Computational complexity theory
Parameterized complexity
Analysis of algorithms
Michael Fellows
Kernelization
Outerplanar graph
Clique
Connectivity
Tree decomposition
Graph theory
Theoretical computer science
Mathematics

k Newsletter of the Parameterized Complexity Community fpt.wikidot.com www.fpt.wikidot.com

Add to Reading List

Source URL: fpt.wdfiles.com

Download Document from Source Website

File Size: 649,67 KB

Share Document on Facebook

Similar Documents

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document