Cliques
A "Cliques" is a maximal complete subgraph within a network, where every pair of distinct vertices is connected by an edge, thus representing the most cohesive form of social or structural integration in graph-theoretic analysis.
1.6K
Publications
102.7K
Citations
3K
Authors
1.2K
Institutions
Publications per year
2017–2026
294
Variants
Clique
Parents
1.6K
Social Network Analysis: A Handbook.
Franz Urban Pappi · Contemporary Sociology A Journal of Reviews · 1993 · 6.1K citations
Algorithm 457: finding all cliques of an undirected graph
Coen Bron, Joep Kerbosch · Communications of the ACM · 1973 · 2.5K citations · Full text
New methods to color the vertices of a graph
Daniel Brélaz · Communications of the ACM · 1979 · 1.6K citations · Full text
Clique is hard to approximate within n1−ε
Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text
1–5 of 1.6K
3K
13
h-index
13
h-index
13
h-index
11
h-index
11
h-index
1–5 of 3K
1.2K

Centre National de la Recherche Scientifique
Paris, France
20 h-index
53 publications
3K citations
University of Florida
Gainesville, United States
20 h-index
32 publications
2.5K citations

Hungarian Academy of Sciences
Budapest, Hungary
16 h-index
30 publications
4.8K citations
University of Technology Sydney
Sydney, Australia
15 h-index
23 publications
1K citations

Universidade Federal do Rio de Janeiro
Rio de Janeiro, Brazil
15 h-index
39 publications
924 citations

Huazhong University of Science and Technology
Wuhan, China
15 h-index
37 publications
1.5K citations
Carnegie Mellon University
Pittsburgh, United States
14 h-index
30 publications
1.5K citations
Georgia Institute of Technology
Atlanta, United States
13 h-index
26 publications
2.1K citations
1–8 of 1.2K
94 publications · 3.7K citations
31
h-index
70 publications · 3.5K citations
31
h-index
38 publications · 2.3K citations
22
h-index
28 publications · 1.2K citations
19
h-index
24 publications · 1.1K citations
18
h-index
1–5