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

Theoretical Computer Science

Volumn 411, Issue 31-33, 2010, Pages 2784-2797

  Horváth, Tamás ^a,b   Ramon, Jan ^c  

^a UNIVERSITY OF BONN   (Germany)

^b FRAUNHOFER IAIS   (Germany)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Data mining; Frequent patterns; Graph mining; Listing algorithms; Tree width

Indexed keywords

COMPLEXITY RESULTS; CONNECTED GRAPH; CONNECTED SUBGRAPHS; FREQUENT PATTERN MINING; FREQUENT PATTERNS; GRAPH MINING; LISTING ALGORITHMS; NP COMPLETE; POLYNOMIAL-TIME; SUBGRAPH ISOMORPHISM; SUBGRAPH MINING; SUBGRAPHS; TREE-WIDTH;

DATA MINING; GRAPH THEORY; MATHEMATICAL OPERATORS; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

GRAPHIC METHODS;

EID: 77955425092     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.03.030     Document Type: Article

References (19)

1. S. Arnborg, and A. Proskurowski Canonical representations of partial 2- and 3-trees BIT 32 2 1992 197 214
2. S. Arnborg, and A. Proskurowski Characterization and recognition of partial 3-trees SIAM Journal on Algebraic and Discrete Methods 7 2 1986 305 314
3. S. Arnborg, and A. Proskurowski Linear time algorithms for NP-hard problems on graphs embedded in k -trees Discrete Applied Mathematics 23 1989 11 24
4. H.L. Bodlaender A tourist guide through treewidth Acta Cybernetica 11 12 1993 1 22
5. H.L. Bodlaender A linear-time algorithm for finding tree-decompositions of small treewidth SIAM Journal on Computing 25 6 1996 1305 1317
6. H.L. Bodlaender A partial k -arboretum of graphs with bounded treewidth Theoretical Computer Science 209 12 1998 1 45
7. H.L. Bodlaender Polynomial algorithms for graph isomorphism and chromatic index on partial k -trees Journal of Algorithms 11 4 1990 631 643
8. Y. Chi, S. Nijssen, R.R. Muntz, and J.N. Kok Frequent subtree mining an overview Fundamenta Informaticae 66 2005 161 198
9. M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis Frequent substructure-based approaches for classifying chemical compounds IEEE Transactions on Knowledge and Data Engineering 17 8 2005 1036 1050
10. M.R. Garey, and D.S. Johnson Computers and Intractability: a Guide to the Theory of NP-completeness 1979 Freeman San Francisco, CA
11. A. Gupta, and N. Nishimura The complexity of subgraph isomorphism for classes of partial k -trees Theoretical Computer Science 164 1&2 1996 287 298 (Pubitemid 126412777)
12. M.T. Hajiaghayi, and N. Nishimura Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth Journal of Computer and System Sciences 73 5 2007 755 768
13. T. Horvth, B. Bringmann, and L. De Raedt Frequent hypergraph mining Proceedings of 16th International Conference on Inductive Logic Programming LNAI vol. 4455 2007 Springer Heidelberg 244 259
14. T. Horvth, J. Ramon, and S. Wrobel Frequent subgraph mining in outerplanar graphs Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2006 ACM Press New York, NY 197 206
15. D.S. Johnson, C.H. Papadimitriou, and M. Yannakakis On generating all maximal independent sets Information Processing Letters 27 3 1988 119 123
16. D.W. Matula Subtree isomorphism in O (n 5 2) Annals of Discrete Mathematics 2 1978 91 106
17. J. Matouek, and R. Thomas On the complexity of finding iso- and other morphisms for partial k -trees Discrete Mathematics 108 13 1992 343 364
18. N. Robertson, and P.D. Seymour Graph minors. II. Algorithmic aspects of treewidth Journal of Algorithms 7 3 1986 309 322
19. M.M. Syslo The subgraph isomorphism problem for outerplanar graphs Theoretical Computer Science 17 1982 91 97