Bounding clique-width via perfect graphs.
Konrad K. DabrowskiShenwei HuangDaniël PaulusmaPublished in: J. Comput. Syst. Sci. (2019)
Keyphrases
- maximum clique
- independent set
- quasi cliques
- graph properties
- upper bound
- directed graph
- series parallel
- graph theory
- graph mining
- maximum weight
- branch and bound algorithm
- graph matching
- graph theoretic
- association graph
- maximum independent set
- database
- subgraph isomorphism
- graph construction
- graph kernels
- graph partitioning
- bipartite graph
- graphical models
- data sets