On generating all maximal independent sets
Information Processing Letters
Subgraph isomorphism for biconnected outerplanar graphs in cubic time
Theoretical Computer Science
Fast discovery of association rules
Advances in knowledge discovery and data mining
List homomorphisms to reflexive graphs
Journal of Combinatorial Theory Series B
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Frequent Substructure-Based Approaches for Classifying Chemical Compounds
IEEE Transactions on Knowledge and Data Engineering
Canonical forms for labelled trees and their applications in frequent subtree mining
Knowledge and Information Systems
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Mining complex power networks for blackout prevention
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Inductive Logic Programming
Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
An integrated, generic approach to pattern mining: data mining template library
Data Mining and Knowledge Discovery
An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules
DS '08 Proceedings of the 11th International Conference on Discovery Science
Large-scale graph mining using backbone refinement classes
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Signatures of Combinatorial Maps
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
A polynomial time algorithm for finding linear interval graph patterns
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Mining of frequent block preserving outerplanar graph structured patterns
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
IEEE Computational Intelligence Magazine
Constant time generation of biconnected rooted plane graphs
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Listing triconnected rooted plane graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Efficient search of combinatorial maps using signatures
Theoretical Computer Science
TGP: mining top-K frequent closed graph pattern without minimum support
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Generating internally triconnected rooted plane graphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Learning from graph data by putting graphs on the lattice
Expert Systems with Applications: An International Journal
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.01 |
In recent years there has been an increased interest in algorithms that can perform frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it becomes intractable for arbitrary graph databases. Existing approaches have therefore resorted to various heuristic strategies and restrictions of the search space, but have not identified a practically relevant tractable graph class beyond trees. In this paper, we define the class of so called tenuous outerplanar graphs, a strict generalization of trees, develop a frequent subgraph mining algorithm for tenuous outerplanar graphs that works in incremental polynomial time, and evaluate the algorithm empirically on the NCI molecular graph dataset.