Sciweavers

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

61

Voted

CORR
2010
Springer

55views Education» more CORR 2010»

Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal

15 years 2 months ago

Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal

Download www.cs.bme.hu

Daniel Lokshtanov, Dániel Marx, Saket Saura

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» Equivalence of local treewidth and linear local treewidth and its algorithmic applications

» CliqueWidth and Parity Games

» Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs

» Parallel Algorithms with Optimal Speedup for Bounded Treewidth

» Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

» An exact almost optimal algorithm for target set selection in social networks

» Optimal Parametric Search on Graphs of Bounded TreeWidth

» Computing the Tutte Polynomial on Graphs of Bounded CliqueWidth

» Complexity and exact algorithms for vertex multicut in interval and bounded treewidth grap...

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Daniel Lokshtanov, Dániel Marx, Saket Saurabh

Comments (0)