On the Maximum Cardinality Search Lower Bound for Treewidth

Proceedings of International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004 (2004), 81--92.

BibTex references

@InProceedings\{BK04b,

author = "Bodlaender, Hans L. and Koster, Arie M.C.A.",

title = "On the Maximum Cardinality Search Lower Bound for Treewidth",

booktitle = "Proceedings of International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004",

series = "Lecture Notes in Computer Science",

volume = "3353",

pages = "81--92",

year = "2004",

note = "http://www.springerlink.com/link.asp?id=kfdwl6hrqnrdm6pq",

}