Sciweavers

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

105

Voted

WEA
2005
Springer

99views Algorithms» more WEA 2005»

Degree-Based Treewidth Lower Bounds

15 years 8 months ago

Degree-Based Treewidth Lower Bounds

Download www.cs.uu.nl

Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlae

Real-time Traffic

Algorithms | WEA 2005 |

claim paper

Related Content

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

» Lower Bounds for the Complexity of Monadic SecondOrder Logic

» A Complete Anytime Algorithm for Treewidth

» A Branch and Bound Algorithm for Exact Upper and Lower Bounds on Treewidth

» Algorithmic Metatheorems for Restrictions of Treewidth

» Contraction and Treewidth Lower Bounds

» On the Maximum Cardinality Search Lower Bound for Treewidth

» Treewidth Lower Bounds with Brambles

» On digraph coloring problems and treewidth duality

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WEA
Authors	Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender

Comments (0)