MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs.
Lars JaffkeHans L. BodlaenderPublished in: CoRR (2015)
Keyphrases
- graph mining
- graph isomorphism
- graph databases
- graph patterns
- graph theoretic
- frequent subgraphs
- bounded degree
- subgraph mining
- graph structures
- planar graphs
- structured data
- directed graph
- graph matching
- graph data
- pattern mining
- graph model
- graph theory
- application domains
- association rule mining
- graph search
- graph structure
- information extraction
- relational databases
- lower bound
- databases