Definability Equals Recognizability for $k$-Outerplanar Graphs.
Lars JaffkeHans L. BodlaenderPublished in: CoRR (2015)
Keyphrases
- graph mining
- graph patterns
- graph isomorphism
- graph databases
- planar graphs
- frequent subgraphs
- subgraph mining
- pattern mining
- graph data
- subgraph isomorphism
- graph structures
- connected components
- structured data
- link prediction
- community detection
- graph search
- pattern discovery
- graph structure
- mining algorithm
- relational data
- binary images
- graphical models
- maximal frequent
- np complete
- information extraction
- rdf data
- frequent itemset mining
- graph model
- graph matching