Bounding the Clique-Width of H-free Split Graphs.
Andreas BrandstädtKonrad Kazimierz DabrowskiShenwei HuangDaniël PaulusmaPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- independent set
- graph properties
- maximum clique
- quasi cliques
- graph matching
- graph theoretic
- maximal clique enumeration
- graph theory
- graph structure
- bipartite graph
- series parallel
- directed graph
- maximum independent set
- graph model
- maximal cliques
- structured objects
- upper bound
- pattern recognition
- image segmentation
- learning algorithm