Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees.
Lars JaffkeHans L. BodlaenderPinar HeggernesJan Arne TellePublished in: Eur. J. Comb. (2017)
Keyphrases
- graph mining
- graph patterns
- graph isomorphism
- graph databases
- frequent subgraphs
- planar graphs
- subgraph mining
- graph data
- pattern mining
- subgraph isomorphism
- graph structures
- structured data
- connected components
- pattern discovery
- tree structure
- mining algorithm
- frequent itemset mining
- graph search
- undirected graph
- community detection
- rdf data
- graph theoretic
- multi dimensional
- graph structure
- frequent patterns
- itemsets