An upper bound on the size of the largest cliques in a graph.
Alain BillionnetPublished in: J. Graph Theory (1981)
Keyphrases
- upper bound
- maximum clique
- branch and bound algorithm
- maximal cliques
- lower bound
- constant factor
- graph structure
- graph theory
- weighted graph
- worst case
- graph theoretic
- branch and bound
- graph model
- random variables
- structured data
- association graph
- link analysis
- spanning tree
- similarity measure
- linear functions
- random walk
- lower and upper bounds
- graph representation
- undirected graph
- neural network
- approximation algorithms
- directed graph