Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth.

Tamás Horváth Jan Ramon

Published in: ECML/PKDD (1) (2008)

Keyphrases

subgraph mining
bounded treewidth
subgraph isomorphism
graph mining
frequent subgraphs
np complete
subspace clustering
semi supervised clustering
connected components
databases
graph matching
graph databases
graph theory