Tamás Horváth, Jan Ramon. Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. In Walter Daelemans, Bart Goethals, Katharina Morik, editors, Machine Learning and Knowledge Discovery in Databases, European Conference, ECML/PKDD 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part I. Volume 5211 of Lecture Notes in Computer Science, pages 520-535, Springer, 2008. [doi]
Abstract is missing.