Journal ArticleDOI
On cliques in graphs
J. W. Moon,L. Moser +1 more
Reads0
Chats0
TLDR
In this article, the maximum number of cliques possible in a graph with n nodes is determined and bounds are obtained for the number of different sizes of clique possible in such a graph.Abstract:
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliques possible in such a graph.read more
Citations
More filters
Book ChapterDOI
Clique, Independent Set, and Vertex Cover
TL;DR: In this paper, the problem of finding maximal and maximum common subgraph isomorphisms between two graphs is studied and a number of interesting applications in diverse scientific and engineering disciplines are discussed.
The first international conference on knowledge engineering principles and techniques (kept 2007)
TL;DR: This article describes several methods for computing the similarity of two words, following two directions: dictionary-based methods that use WordNet, Roget’s thesaurus, or other resources; and corpus-based method that use frequencies of co-occurrence in corpora (cosine method, latent semantic indexing, mutual information, etc).
Proceedings ArticleDOI
Querying for different similar images using maximum independent sets of a graph
TL;DR: A new method based on graph theory techniques is presented in order to select a set of images among those that might be offered in a tool dedicated to image retrieval.
Journal ArticleDOI
The student scheduling problem at Université de Technologie de Compiègne
TL;DR: A MIP model is proposed to maximize the number of assigned students while managing limited resources and the impact of clique inequalities on computing times is investigated.
References
More filters