Bounding the clique-width of H-free split graphs.
Andreas BrandstädtKonrad K. DabrowskiShenwei HuangDaniël PaulusmaPublished in: Discret. Appl. Math. (2016)
Keyphrases
- independent set
- maximum clique
- graph properties
- graph theoretic
- maximum independent set
- upper bound
- graph theory
- graph matching
- branch and bound algorithm
- quasi cliques
- graph databases
- graph data
- maximum weight
- maximal clique enumeration
- real time
- graph kernels
- graph mining
- weighted graph
- graph structure
- social networks
- neural network