Klaus Meer, Dieter Rautenbach. On the OBDD Size for Graphs of Bounded Tree- and Clique-Width. In Hans Leo Bodlaender, Michael A. Langston, editors, Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings. Volume 4169 of Lecture Notes in Computer Science, pages 72-83, Springer, 2006. [doi]
@inproceedings{MeerR06,
title = {On the OBDD Size for Graphs of Bounded Tree- and Clique-Width},
author = {Klaus Meer and Dieter Rautenbach},
year = {2006},
doi = {10.1007/11847250_7},
url = {http://dx.doi.org/10.1007/11847250_7},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/MeerR06},
cites = {0},
citedby = {0},
pages = {72-83},
booktitle = {Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings},
editor = {Hans Leo Bodlaender and Michael A. Langston},
volume = {4169},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-39098-7},
}