On the Maximum Cardinality Search Lower Bound for Treewidth - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Hans Leo Bodlaender, Arie M. C. A. Koster. On the Maximum Cardinality Search Lower Bound for Treewidth. In Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel, editors, Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers. Volume 3353 of Lecture Notes in Computer Science, pages 81-92, Springer, 2004. [doi]

Identified as Hans Leo Bodlaender This author has not been identified. Look up 'Arie M. C. A. Koster' in Google

runs on WebDSL