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
Mining maximal cliques from a large graph using MapReduce
TL;DR: A new parallel algorithm for MCE, Parallel Enumeration of Cliques using Ordering ( PECO), designed for the MapReduce framework, which can effectively process a variety of large real-world graphs with millions of vertices and tens of millions of maximal cliques, and scales well with the degree of available parallelism.
Journal ArticleDOI
Exact Algorithms for Edge Domination
TL;DR: It is shown that the related problems: minimum weight edge dominating set, minimum maximal matching and minimum weight maximal matching can be solved in O(1.3226n) time and polynomial space using modifications of the algorithm for edge dominate set.
Journal ArticleDOI
Protein complex prediction for large protein protein interaction networks with the Core&Peel method
TL;DR: The algorithm Core&Peel pushes forward the state-of-the-art in PPIN clustering providing an algorithmic solution with polynomial running time that attains experimentally demonstrable good output quality and speed on challenging large real networks.
Journal ArticleDOI
Enumeration of isolated cliques and pseudo-cliques
Hiro Ito,Kazuo Iwama +1 more
TL;DR: Some cases that can be solved in polynomial time and some other cases that have a superpolynomial number of solutions are obtained.
Journal ArticleDOI
New parameterized algorithms for the edge dominating set problem
TL;DR: The parameterized edge dominating set problem can be solved in O^*(2.3147^k) time and polynomial space and can be reduced to a quadratic kernel with O(k^3) edges.
References
More filters