<--- Back to Details
First PageDocument Content
Graph operations / Tree decomposition / Tree / Connectivity / Dominating set / Directed acyclic graph / Graph / Matching / Clique / Graph theory / Mathematics / Theoretical computer science
Date: 2010-10-27 06:30:50
Graph operations
Tree decomposition
Tree
Connectivity
Dominating set
Directed acyclic graph
Graph
Matching
Clique
Graph theory
Mathematics
Theoretical computer science

Logspace Versions of the Theorems of Bodlaender and Courcelle Michael Elberfeld Andreas Jakoby

Add to Reading List

Source URL: wwwmayr.informatik.tu-muenchen.de

Download Document from Source Website

File Size: 357,75 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