Lower bounds for the clique and the chromatic numbers of a graph.
C. S. EdwardsC. H. ElphickPublished in: Discret. Appl. Math. (1983)
Keyphrases
- lower bound
- maximum clique
- branch and bound algorithm
- maximum weight
- upper bound
- quasi cliques
- graph properties
- branch and bound
- np hard
- min sum
- objective function
- maximal clique enumeration
- graph representation
- weighted graph
- graph theory
- human perception
- maximum independent set
- worst case
- bipartite graph
- lower and upper bounds
- graph theoretic
- graph mining
- independent set
- random walk
- maximal cliques
- connected components
- directed graph
- clique tree
- bayesian networks
- learning theory
- upper and lower bounds
- vc dimension
- graph partitioning
- spanning tree
- graph model