Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs.
Aistis AtminasRobert BrignallVadim V. LozinJuraj StachoPublished in: Discret. Appl. Math. (2021)
Keyphrases
- graph properties
- maximum clique
- quasi cliques
- graph mining
- graph databases
- subgraph matching
- graph theoretic
- subgraph isomorphism
- graph structures
- independent set
- finite number
- directed graph
- graph data
- graph theory
- graph matching
- frequently occurring
- labeled graphs
- maximum common subgraph
- pattern mining
- connected subgraphs
- reachability queries
- frequent subgraph mining
- maximal cliques
- inductive inference