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
Iterative Compression and Exact Algorithms
TL;DR: Iterative compression has recently led to a number of breakthroughs in parameterized complexity and it is shown that the technique can also be useful in the design of exact exponential time algorithms to solve NP-hard problems.
Journal ArticleDOI
Complexity Results on Graphs with Few Cliques
Bill Rosgen,Lorna Stewart +1 more
TL;DR: Several classes of graphs which have few cliques are discussed, and the complexity of some partitioning and covering problems are determined for the class of all graphs, which have fewer cliques than a given polynomial bound.
Book
Data Management for Multimedia Retrieval
TL;DR: This textbook on multimedia data management techniques offers a unified perspective on retrieval efficiency and effectiveness and presents data structures and algorithms that help store, index, cluster, classify, and access common data representations.
Journal Article
3-Coloring in time O(1.3446 n ): A no-MIS Algorithm
Richard Beigel,David Eppstein +1 more
Journal ArticleDOI
Formalizing and solving the problem of clustering in MCDA
Patrick Meyer,Patrick Meyer,Alexandru Liviu Olteanu,Alexandru Liviu Olteanu,Alexandru Liviu Olteanu +4 more
TL;DR: The problem of clustering in MCDA is formally defined using notions that are native to this field alone, and a stochastic heuristic approach is proposed, which is validated through tests on a large set of artificially generated benchmarks.
References
More filters