Sciweavers

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

113

Voted

ALGORITHMICA
2008

72views more ALGORITHMICA 2008»

Treewidth Lower Bounds with Brambles

15 years 2 months ago

Treewidth Lower Bounds with Brambles

Download www.zib.de

Hans L. Bodlaender, Alexander Grigoriev, Arie M. C

Real-time Traffic

ALGORITHMICA 2007 | ALGORITHMICA 2008 |

claim paper

Related Content

» Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions

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

» Contraction and Treewidth Lower Bounds

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

» DegreeBased Treewidth Lower Bounds

» On the Maximum Cardinality Search Lower Bound for Treewidth

» Compact Navigation and Distance Oracles for Graphs with Small Treewidth

» Lower Bounds for the Complexity of Monadic SecondOrder Logic

» A Complete Anytime Algorithm for Treewidth

Post Info
More Details (n/a)

Added	24 Dec 2010
Updated	24 Dec 2010
Type	Journal
Year	2008
Where	ALGORITHMICA
Authors	Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster

Comments (0)