Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
Konrad K. DabrowskiDaniël PaulusmaPublished in: Comput. J. (2016)
Keyphrases
- graph properties
- maximum clique
- quasi cliques
- graph mining
- graph theory
- labeled graphs
- graph databases
- subgraph mining
- graph structure
- graph theoretic
- directed graph
- independent set
- maximum weight
- maximal cliques
- graph structures
- graph representation
- graph data
- frequent subgraph mining
- frequently occurring
- connected subgraphs
- maximal clique enumeration
- data structure
- pattern mining
- random walk
- topological information
- association graph
- frequent subgraphs
- fully connected
- graph patterns
- spanning tree
- bipartite graph
- branch and bound algorithm
- connected components