<--- Back to Details
First PageDocument Content
NP-complete problems / Analysis of algorithms / Parameterized complexity / Planar graphs / Graph operations / Bidimensionality / Apex graph / Tree decomposition / Dominating set / Graph theory / Theoretical computer science / Mathematics
Date: 2004-10-18 03:25:13
NP-complete problems
Analysis of algorithms
Parameterized complexity
Planar graphs
Graph operations
Bidimensionality
Apex graph
Tree decomposition
Dominating set
Graph theory
Theoretical computer science
Mathematics

Add to Reading List

Source URL: erikdemaine.org

Download Document from Source Website

File Size: 256,55 KB

Share Document on Facebook

Similar Documents

Edsger W. Dijkstra / Network theory / Shortest path problem / Constructible universe / Total least squares

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

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document