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
On the Number of Maximal Cliques in Two-Dimensional Random Geometric Graphs: Euclidean and Hyperbolic
TL;DR: In this article , the number of maximal cliques in Euclidean random geometric graphs and hyperbolic random graphs has been shown to be lower and upper bounded with high probability for any ε > 0.
A Verified Program for the Enumeration of All Maximal Independent Sets
TL;DR: In this article, the authors present a list of references and acknowledgements to the authors of this article: 1) Dedication, 2) Dedicated, 3) Acknowledgments, 4) Figures, 5) List of Tables, 6) Table 1.
Journal ArticleDOI
Maximal Defective Clique Enumeration
TL;DR: In this paper , a branch-and-bound algorithm with a novel pivoting technique was proposed to enumerate all maximal s-defective cliques, which allows at most s edges to be missing.
Book ChapterDOI
Memristive Computing for NP-Hard AI Problems
TL;DR: A circuit-level CA-inspired approach for in-memory computing schemes using memristors and composite memristive components, aiming to set off parallel computing capabilities and improve CA-based hardware accelerators for NP-hard AI problems.
Journal ArticleDOI
Faster maximal clique enumeration in large real-world link streams
TL;DR: In this paper , the authors proposed a new algorithm which matches the cliques of the instantaneous graphs formed by links existing at a given time $t$ to the maximal cliques in the link stream.
References
More filters