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

DOI10.1016/j.tcs.2010.03.030zbMath1192.68483OpenAlexW2171271527MaRDI QIDQ982649

Jan Ramon, Tamás L. Horváth

Publication date: 7 July 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.030

zbMATH Keywords

data miningtree-widthlisting algorithmsgraph miningfrequent patterns

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Probabilistic frequent subtrees for efficient graph classification and retrieval ⋮ On maximum common subgraph problems in series-parallel graphs ⋮ Probabilistic and exact frequent subtree mining in graphs beyond forests ⋮ Nearly exact mining of frequent trees in large networks ⋮ Mine ’Em All: A Note on Mining All Graphs ⋮ Efficient Pattern Matching on Graph Patterns of Bounded Treewidth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of subgraph isomorphism for classes of partial k-trees
• Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
• The subgraph isomorphism problem for outerplanar graphs
• On generating all maximal independent sets
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Canonical representations of partial 2- and 3-trees
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• A partial k-arboretum of graphs with bounded treewidth
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• Characterization and Recognition of Partial 3-Trees
• Graph minors. II. Algorithmic aspects of tree-width
• Subtree Isomorphism in O(n5/2)
• Frequent Hypergraph Mining
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth