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
Learning parse structure of paragraphs and its applications in search
TL;DR: It is demonstrated that search relevance is improved by PT generalization, using Bing search engine API as a baseline and the comparative analysis of contribution of various sources of discourse information to the relevance.
Proceedings ArticleDOI
Distributed Maximal Clique Computation
TL;DR: This paper proposes a distributed algorithm built on a share-nothing architecture for computing the set of maximal cliques, which effectively address the problem of skewed workload distribution due to high-degree vertices, which also leads to drastically reduced worst-case time complexity for computing maximal clique in common real-world graphs.
Journal ArticleDOI
Feedback Vertex Sets in Tournaments
Serge Gaspers,Matthias Mnich +1 more
TL;DR: In this article, it was shown that every tournament on n vertices has at most 1.6740n minimal FVSs, and that there is an infinite family of tournaments, all having at least 1.5448n minimal vertex sets.
Posted Content
Clique pooling for graph classification
TL;DR: A novel graph pooling operation using cliques as the unit pool is proposed, more readily interpretable, a better analogue to image coarsening than filtering or pruning techniques, and entirely nonparametric.
Journal ArticleDOI
Maximal independent sets in graphs with at most one cycle
Min-Jen Jou,Gerard J. Chang +1 more
TL;DR: This paper determines the largest number of maximal independent sets among all connected graphs of order n, which contain at most one cycle, and characterize those extremal graphs achieving this maximum value.
References
More filters