Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
k-clique
Description:
A set of k vertices in a graph in which every pair of vertices is connected by an edge.
Primary topic:
Complex Network Analysis Techniques (21%)
Related topics:
Complex Network Analysis Techniques (21%),
Advanced Graph Theory Research (19%),
Complexity and Algorithms in Graphs (14%),
Graph Theory and Algorithms (9%),
Limits and Structures in Graph Theory (7%)
Wikidata ID:
wiki/Q761631
OpenAlex ID:
keywords/k-clique
On the parameterized complexity of multiple-interval graph problems
2008
·
Michael R. Fellows
, Danny Hermelin
, et al.
·
Theoretical Computer Science
·
435
On the densest k-subgraph problems
1997
·
Uriel Feige
, M. Seltser
·
141
On the power of Ambainis lower bounds
2005
·
Shengyu Zhang
·
Theoretical Computer Science
·
104
PDF
Interactive PCP
2008
·
Yael Tauman Kalai
, Ran Raz
·
Lecture notes in computer science
·
99
On the variational problem for upper tails in sparse random graphs
2016
·
Eyal Lubetzky
, Yufei Zhao
·
Random Structures and Algorithms
·
86
PDF
Losing Weight by Gaining Edges
2014
·
Amir Abboud
, Kevin Lewi
, et al.
·
Lecture notes in computer science
·
80
Clique Counting in MapReduce: Algorithms and Experiments
2015
·
Irene Finocchi
, Marco Finocchi
, et al.
·
ACM Journal of Experimental Algorithmics
·
68
PDF
Isolation of k -cliques
2020
·
Peter Borg
, Kurt Fenech
, et al.
·
Discrete Mathematics
·
63
PDF
An Efficient movie recommendation algorithm based on improved k-clique
2018
·
Phonexay Vilakone
, Doo-Soon Park
, et al.
·
Human-centric Computing and Information Sciences
·
62
PDF
Clique percolation
2009
·
Béla Bollobás
, Oliver Riordan
·
Random Structures and Algorithms
·
59
PDF
Efficient DNA sticker algorithms for NP-complete graph problems
2002
·
Karl-Heinz Zimmermann
·
Computer Physics Communications
·
57
On the Power of Ambainis’s Lower Bounds
2004
·
Shengyu Zhang
·
Lecture notes in computer science
·
54
PDF
Motif Prediction with Graph Neural Networks
2022
·
Maciej Besta
, Raphael Grob
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
53
PDF
A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
2017
·
Bringmann, K.
·
Max Planck Digital Library
·
44
Cliques in hyperbolic random graphs
2015
·
Tobias Friedrich
, Anton Krohmer
·
IEEE Conference on Computer Communications (INFOCOM)
·
42
A Tutorial on Clique Problems in Communications and Signal Processing
2020
·
Ahmed Douik
, Hayssam Dahrouj
, et al.
·
Proceedings of the IEEE
·
38
PDF
The Parameterized Complexity of k-Biclique
2014
·
Lin, Bingkai
·
arXiv (Cornell University)
·
37
PDF
An Algorithm to Discover the k-Clique Cover in Networks
2009
·
Luís Cavique
, Armando B. Mendes
, et al.
·
Lecture notes in computer science
·
34
A review of clique-based overlapping community detection algorithms
2022
·
Sumit Kumar Gupta
, Dhirendra Pratap Singh
, et al.
·
Knowledge and Information Systems
·
33
Random Enriched Trees with Applications to Random Graphs
2018
·
Benedikt Stufler
·
The Electronic Journal of Combinatorics
·
32
On the parameterized complexity of some optimization problems related to multiple-interval graphs
2010
·
Minghui Jiang
·
Theoretical Computer Science
·
28
PDF
On the clique-transversal number of chordal graphs
1998
·
Thomas Andreae
·
Discrete Mathematics
·
28
Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem
2014
·
Donald Davendra
, Ivan Zelinka
, et al.
·
Advances in intelligent systems and computing
·
27
Fairness-Aware Clique-Preserving Spectral Clustering of Temporal Graphs
2023
·
Dongqi Fu
, Dawei Zhou
, et al.
·
International World Wide Web Conference (WWW)
·
26
PDF
Graph theoretic generalizations of clique: Optimization and extensions
2009
·
Balabhaskar Balasundaram
·
OakTrust (Texas A&M University Libraries)
·
26
Show more works
View as search
Works count:
129
Citation count:
2,146
Year
Topic
Type