, gem)-free graphs have bounded clique-width.
Andreas BrandstädtHoàng-Oanh LeRaffaele MoscaPublished in: Discret. Appl. Math. (2005)
Keyphrases
- independent set
- graph properties
- maximum clique
- quasi cliques
- graph theoretic
- directed graph
- maximum weight
- maximum independent set
- graph clustering
- graph matching
- graph model
- bounded treewidth
- series parallel
- bipartite graph
- image segmentation
- neural network
- graph partitioning
- graph representation
- graph mining
- graph construction
- subgraph isomorphism
- graph theory
- knn