Efficient frequent connected subgraph mining in graphs of bounded tree-width
type: Item
instance of: scholarly article
title: Efficient frequent connected subgraph mining in graphs of bounded tree-width
zbMATH Open document ID: 1192.68483
author: Jan Ramon
author: T. Horváth
published in: Theoretical Computer Science
publication date: 2010-07-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 5731728
zbMATH Keywords: listing algorithms
zbMATH Keywords: frequent patterns
zbMATH Keywords: tree-width
zbMATH Keywords: graph mining
zbMATH Keywords: data mining
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.03.030
OpenAlex ID: W2171271527
cites work: Canonical representations of partial 2- and 3-trees
cites work: Characterization and Recognition of Partial 3-Trees
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Q4291429
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
cites work: Q5472871
cites work: Q4198056
cites work: The complexity of subgraph isomorphism for classes of partial k-trees
cites work: Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
cites work: Frequent Hypergraph Mining
cites work: On generating all maximal independent sets
cites work: Subtree Isomorphism in O(n5/2)
cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: The subgraph isomorphism problem for outerplanar graphs
DOI: 10.1016/J.TCS.2010.03.030
Recommended article: An Efficient Approach for Mining Frequent Subgraphs
Recommended article: Q4423976
Recommended article: Probabilistic and exact frequent subtree mining in graphs beyond forests
Recommended article: A fast algorithm for mining frequent subgraphs
description: scientific article; zbMATH DE number 5731728