Sciweavers

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

9

WG
2004
Springer

favoriteEmaildiscussreport

79views Theoretical Computer Science» more WG 2004»

On the Maximum Cardinality Search Lower Bound for Treewidth

13 years 9 months ago

On the Maximum Cardinality Search Lower Bound for Treewidth

Download www.cs.uu.nl

Hans L. Bodlaender, Arie M. C. A. Koster

Real-time Traffic

Computer Science | WG 2004 |

claim paper

Related Content

» Contraction and Treewidth Lower Bounds

» Lower bounds and heuristic algorithms for the k

» Using Constraint Programming to Solve the Maximum Clique Problem

» Solving MAP Exactly by Searching on Compiled Arithmetic Circuits

» Ternary Constant Weight Codes

» A simple and effective algorithm for the MaxMin diversity problem

» Covering a hypergraph of subgraphs

» A Complete Anytime Algorithm for Treewidth

» Nondeterministic Graph Searching From Pathwidth to Treewidth

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WG
Authors	Hans L. Bodlaender, Arie M. C. A. Koster

Comments (0)