New upper bound heuristics for treewidth

E. Bachoore; H.L. Bodlaender

doi:10.1007/11427186_20

New upper bound heuristics for treewidth

Dept of Information and Computing Sciences

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

Original language	English
Title of host publication	Experimental and Efficient Algorithms
Subtitle of host publication	4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005. Proceedings
Editors	Sotiris E. Nikoletseas
Publisher	Springer
Pages	216-227
ISBN (Electronic)	978-3-540-32078-4
ISBN (Print)	978-3-540-25920-6
DOIs	https://doi.org/10.1007/11427186_20
Publication status	Published - 2005

Publication series

Name	Lecture Notes in Computer Science
Volume	3503
ISSN (Print)	0302-9743

Access to Document

10.1007/11427186_20

Cite this

@inproceedings{54a40c263a3c4644902058e074857d2f,

title = "New upper bound heuristics for treewidth",

author = "E. Bachoore and H.L. Bodlaender",

year = "2005",

doi = "10.1007/11427186\_20",

language = "English",

isbn = "978-3-540-25920-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "216--227",

editor = "Nikoletseas, \{Sotiris E.\}",

booktitle = "Experimental and Efficient Algorithms",

}

New upper bound heuristics for treewidth. / Bachoore, E.; Bodlaender, H.L.
Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005. Proceedings. ed. / Sotiris E. Nikoletseas. Springer, 2005. p. 216-227 (Lecture Notes in Computer Science; Vol. 3503).

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