Live briefing
Everything about Clique problem
Task of computing complete subgraphs
In computer science, the clique problem is the computational problem of finding cliques in a graph. It has several different formulations depending on which cliques, and what information about the cliques, should be found. Common formulations of the clique problem include finding a maximum clique, finding a maximum weight clique in a weighted graph, listing all maximal cliques, and solving the decision problem of testing whether a graph contains a clique larger than a given size. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Clique problemA 5-minute orientation
- Skim a recent paper: Fixed set search applied to the clique partitioning problemInfluential work since 2022
- Pick up a classic book: LotteryThe most-reprinted book on the subject
- Read the landmark paper: DNA Solution of the Maximal Clique ProblemCited 477 times
- Go sideways: Independent set (graph theory)A closely related topic
- Go sideways: Dense subgraphA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
DNA Solution of the Maximal Clique Problem
A fast algorithm for the maximum clique problem
An exact algorithm for the maximum clique problem
The maximum clique problem
Continuous Characterizations of the Maximum Clique Problem
Dynamic Local Search for the Maximum Clique Problem
On the maximum quasi-clique problem
The clique partitioning problem: Facets and patching facets
🆕 Influential since 2022
Fixed set search applied to the clique partitioning problem
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem
The landscape of the planted clique problem: Dense subgraphs and the overlap gap property
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study
A stepped tabu search method for the clique partitioning problem
📚 Books worth reading
LotteryBeth Goobie · 2002
Some girls areCourtney Summers · 2010
花より男子 11Yoko Kamio · 1995
Some girls areCourtney Summers · 2010
CapriciousGabrielle Prendergast · 2014
Some girls areCourtney Summers · 2010
イタズラなKiss 22Kaoru Tada · 1996- 📕Inverse Problems and Zero Forcing for GraphsLeslie Hogben, Jephian C.-H. Lin · 2022
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Independent set (graph theory) In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a…
- Dense subgraph In graph theory and computer science, a dense subgraph is a subgraph with many edges per vertex. This is formalized as follows: let G = (V, E) be an undirected…
- Maximal independent set In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In other…
- Clique cover In graph theory, a clique cover or partition into cliques of a given undirected graph is a collection of cliques that cover the whole graph. Generally…
- Clique (graph theory) In graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are…
- Maximum cut In a graph, a maximum cut is a cut whose size is at least the size of any other cut. That is, it is a partition of the graph's vertices into two complementary…
- Maximum common induced subgraph In graph theory and theoretical computer science, a maximum common induced subgraph of two graphs G and H is a graph that is an induced subgraph of both…
- Maximum common edge subgraph Given two graphs G {\displaystyle G} and G ′ {\displaystyle G'} , the maximum common edge subgraph problem (or MCES problem) is the problem of finding…