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
Journal ArticleDOI
Graphical potential games
Yakov Babichenko,Omer Tamuz +1 more
TL;DR: It is shown that this class of potential games that are also graphical games with respect to a given graph G of connections between the players can be identified with the set of Markov random fields on G and it follows that the potentials of such games can be decomposed into local potentials.
Posted Content
On the Complexity of Solution Extension of Optimization Problems
TL;DR: This work proposes a general, partial-order based formulation of such extension problems and study a number of specific problems which can be expressed in this framework, as well as the optimality of simple exact algorithms under the Exponential-Time Hypothesis.
Journal ArticleDOI
Improved Source Coding Exponents via Witsenhausen's Rate
TL;DR: A novel upper-bound on Witsenhausen's rate, the rate required in the zero-error analogue of the Slepian-Wolf problem, is provided in terms of a new information-theoretic functional defined on a certain graph and is derived by upper bounding complementary graph entropy.
Journal ArticleDOI
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication
TL;DR: Improve the asymptotics for the exploration of the same RS-tree by grouping the offsprings’ computation even further and rely on rectangular fast matrix multiplication in order to compute all children of n^2$$n2 nodes in one single shot.
Journal ArticleDOI
Combinatorial clustering: Literature review, methods, examples
TL;DR: The paper addresses clustering problems from combinatorial viewpoints and a systemic survey is presented, targeted to networking.
References
More filters