Heidi Gebauer, Yoshio Okamoto. Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes. In Joachim Gudmundsson, C. Barry Jay, editors, Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30 - Febuary 2, 2007, Ballarat, Victoria, Australia, Proceedings. Volume 65 of CRPIT, pages 63-69, Australian Computer Society, 2007. [doi]
@inproceedings{GebauerO07,
title = {Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes},
author = {Heidi Gebauer and Yoshio Okamoto},
year = {2007},
url = {http://crpit.com/abstracts/CRPITV65Gebauer.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GebauerO07},
cites = {0},
citedby = {0},
pages = {63-69},
booktitle = {Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30 - Febuary 2, 2007, Ballarat, Victoria, Australia, Proceedings},
editor = {Joachim Gudmundsson and C. Barry Jay},
volume = {65},
series = {CRPIT},
publisher = {Australian Computer Society},
isbn = {1-920-68246-5},
}