Bounding the Clique-Width of $H$-free Split Graphs.
Andreas BrandstädtKonrad K. DabrowskiShenwei HuangDaniël PaulusmaPublished in: CoRR (2015)
Keyphrases
- independent set
- maximum clique
- graph properties
- graph theoretic
- upper bound
- graph theory
- maximum independent set
- quasi cliques
- graph matching
- graph mining
- database
- graph databases
- graph structure
- data structure
- undirected graph
- series parallel
- subgraph isomorphism
- maximal cliques
- aspect ratio
- graph kernels
- graph partitioning
- spanning tree
- graph model
- directed graph
- social networks
- data mining