Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
Konrad K. DabrowskiDaniël PaulusmaPublished in: CIAC (2015)
Keyphrases
- graph properties
- quasi cliques
- maximum clique
- graph mining
- maximum weight
- labeled graphs
- directed graph
- graph databases
- graph theory
- graph data
- graph structures
- graph theoretic
- branch and bound algorithm
- graph representation
- frequent subgraph mining
- bipartite graph
- random walk
- association graph
- frequently occurring
- graph structure
- independent set
- subgraph isomorphism
- frequent subgraphs
- graph clustering
- equivalence classes
- pattern mining
- data structure
- class labels
- graph partitioning
- subgraph mining
- topological information
- algebraic operations
- structured data
- graph matching
- weighted graph
- d objects