On the Maximum Cardinality Search Lower Bound for Treewidth

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	Undefined/Unknown
Title of host publication	Proceedings 30th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2004
Place of Publication	Berlin
Publisher	Springer
Pages	81-92
Number of pages	12
Publication status	Published - 2004

138b

Keywords

@inproceedings{02db5f8a5323488eaf6d8971c571d0f3,

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

keywords = "Wiskunde en Informatica (WIIN)",

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

note = "138b",

year = "2004",

language = "Undefined/Unknown",

pages = "81--92",

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

publisher = "Springer",

}