An upper bound on the size of a largest clique in a graph.
Dennis P. GeoffroyDavid P. SumnerPublished in: J. Graph Theory (1978)
Keyphrases
- upper bound
- maximum clique
- branch and bound algorithm
- lower bound
- constant factor
- maximal cliques
- maximum weight
- independent set
- maximal clique enumeration
- branch and bound
- directed graph
- graph properties
- graph theory
- graph structure
- graph theoretic
- quasi cliques
- random walk
- memory requirements
- graph matching
- neural network
- lower and upper bounds
- worst case
- pairwise
- bounded degree
- weighted graph
- association graph
- graph representation
- graph partitioning
- connected components
- optimal solution