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. In Martin Atzmueller, Dominik Benz, Andreas Hotho, Gerd Stumme, editors, LWA 2010 - Lernen, Wissen & Adaptivität, Workshop Proceedings, Kassel, 4.-6. Oktober 2010. pages 75, 2010. [doi]

Abstract

Abstract is missing.