An upper bound on the number of cliques in a graph.

Martin Farber Mihály Hujter Zsolt Tuza

Published in: Networks (1993)

Keyphrases

upper bound
constant factor
computational complexity
lower bound
real time
small number
directed graph
branch and bound algorithm
bipartite graph
graph structure
weighted graph
undirected graph
graph representation
minimum distance