Efficient frequent connected subgraph mining in graphs of bounded tree-width

Tamás Horváth, Jan Ramon. Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theoretical Computer Science, 411(31-33):2784-2797, 2010. [doi]

Abstract

Abstract is missing.