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]
@inproceedings{BodlaenderK04,
title = {On the Maximum Cardinality Search Lower Bound for Treewidth},
author = {Hans Leo Bodlaender and Arie M. C. A. Koster},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3353&spage=81},
tags = {C++, search},
researchr = {https://researchr.org/publication/BodlaenderK04},
cites = {0},
citedby = {0},
pages = {81-92},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel},
volume = {3353},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-24132-9},
}