Upper bounds to the clique width of graphs.
Bruno CourcelleStephan OlariuPublished in: Discret. Appl. Math. (2000)
Keyphrases
- upper bound
- maximum clique
- branch and bound algorithm
- lower bound
- independent set
- lower and upper bounds
- upper and lower bounds
- graph properties
- tight bounds
- quasi cliques
- graph theoretic
- branch and bound
- worst case
- graph theory
- efficiently computable
- graph matching
- maximum weight
- graph databases
- graph representation
- weighted graph
- graph mining
- sample complexity
- average case
- directed graph
- pairwise
- learning algorithm