Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth

Authors:
Tamás Horváth;Jan Ramon
Affiliations:
Dept. of Computer Science III, University of Bonn, Germany and Fraunhofer IAIS, Schloss Birlinghoven, Sankt Augustin, Germany;Dept. of Computer Science, Katholieke Universiteit Leuven, Belgium
Venue:
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Year:
2008

Citing 12
Cited 0

On generating all maximal independent sets

Information Processing Letters
Linear time algorithms for NP-hard problems restricted to partial k-trees

Discrete Applied Mathematics
On the complexity of finding iso- and other morphisms for partial k-trees

Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
The complexity of subgraph isomorphism for classes of partial k-trees

Theoretical Computer Science
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Frequent Substructure-Based Approaches for Classifying Chemical Compounds

IEEE Transactions on Knowledge and Data Engineering
Frequent subgraph mining in outerplanar graphs

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Frequent Subtree Mining - An Overview

Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth

Journal of Computer and System Sciences
Frequent Hypergraph Mining

Inductive Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The frequent connected subgraph mining problem, i.e., the problem of listing all connected graphs that are subgraph isomorphic to at least a certain number of transaction graphs of a database, cannot be solved in output polynomial time in the general case. If, however, the transaction graphs are restricted to forests then the problem becomes tractable. In this paper we generalize the positive result on forests to graphs of bounded treewidth. In particular, we show that for this class of transaction graphs, frequent connected subgraphs can be listed in incremental polynomial time. Since subgraph isomorphism remains NP-complete for bounded treewidth graphs, the positive complexity result of this paper shows that efficient frequent pattern mining is possible even for computationally hard pattern matching operators.