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
Proceedings ArticleDOI
Spectrum bandit optimization
TL;DR: In this article, the problem of allocating radio channels to links in a wireless network is formulated as a generic linear bandit problem and analyzed in a stochastic setting where radio conditions are driven by a i.i.d. stochastically process.
Journal ArticleDOI
Semantic Representations and Query Languages for Or-Sets
Leonid Libkin,Limsoon Wong +1 more
TL;DR: A query language with adequate expressive power for or- sets is formulated using the notion of normalization of or-sets, and queries at the “structural” and “conceptual” levels are distinguished.
Journal ArticleDOI
MIMO: an efficient tool for molecular interaction maps overlap
TL;DR: MIMO offers a flexible and efficient graph-matching tool for comparing complex biological pathways and relies directly on the rich graph topology described in the Systems Biology Markup Language (SBML) standard to efficiently handle multiple queries on biological graph databases.
Proceedings ArticleDOI
Enumerating k-Vertex Connected Components in Large Graphs
TL;DR: In this article, the authors proposed two effective optimization strategies, namely neighbor sweep and group sweep, to reduce the number of local connectivity testings in k-VCC enumeration.
Journal ArticleDOI
Note: Graphs with the second largest number of maximal independent sets
Zemin Jin,Xueliang Li +1 more
TL;DR: This paper determines the second largest number of maximal independent sets among all trees and forests of order n>=4 and characterize those extremal graphs achieving these values.
References
More filters