<--- Back to Details
First PageDocument Content
NP-complete problems / Analysis of algorithms / Bidimensionality / Parameterized complexity / Planar graphs / Tree decomposition / Clique-sum / Minor / Branch-decomposition / Graph theory / Theoretical computer science / Graph operations
Date: 2005-07-24 15:36:22
NP-complete problems
Analysis of algorithms
Bidimensionality
Parameterized complexity
Planar graphs
Tree decomposition
Clique-sum
Minor
Branch-decomposition
Graph theory
Theoretical computer science
Graph operations

The Bidimensionality Theory and Its Algorithmic Applications by MohammadTaghi Hajiaghayi B.S., Sharif University of Technology, 2000

Add to Reading List

Source URL: erikdemaine.org

Download Document from Source Website

File Size: 890,97 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