Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

CORR
2011
Springer

favoriteEmaildiscussreport

159views Education» more CORR 2011»

Solving connectivity problems parameterized by treewidth in single exponential time

13 years 5 months ago

Solving connectivity problems parameterized by treewidth in single exponential time

Download folk.uib.no

Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Mi

Real-time Traffic

CORR 2011 | Education |

claim paper

Related Content

» A lower bound for the treewidth of planar graphs with vital linkages

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» PAClearning Bounded Treewidth Graphical Models

» Hjoin decomposable graphs and algorithms with runtime single exponential in rankwidth

» Combinatorial Auctions with Structured Item Graphs

» An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk

Comments (0)