Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
Konrad K. DabrowskiDaniël PaulusmaPublished in: CoRR (2014)
Keyphrases
- graph properties
- maximum clique
- quasi cliques
- graph mining
- graph theory
- maximum weight
- graph databases
- graph structures
- graph theoretic
- subgraph mining
- frequent subgraph mining
- directed graph
- subgraph matching
- labeled graphs
- graph data
- query graph
- structured data
- equivalence classes
- data structure
- branch and bound algorithm
- subgraph isomorphism
- graph structure
- random walk
- frequent subgraphs
- graph matching
- graph representation
- connected subgraphs
- reachability queries
- independent set
- graph clustering
- maximal clique enumeration
- strongly connected
- maximal cliques
- frequently occurring
- biological networks
- directed acyclic graph
- bipartite graph
- class labels
- graphical models