Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes

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]

Abstract

Abstract is missing.