Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

clique problem · Vinony

EntityQ1196873· pop 18· linked from 64 articles

clique problem

Sign in to save

computational problem of finding cliques in a graph

Connections

glossary of graph theory terms

P versus NP problem

time complexity

Springer Science+Business Media

boolean satisfiability problem

complement graph

independent set

lexicographical order

approximation algorithm

parameterized complexity

decision tree model

computer science

International Standard Book Number

Categories

Computational problems in graph theory NP-complete problems

Sources

wikipedia.externallinksexternallink

What links here64 pages

approximation algorithm

boolean satisfiability problem

quadratic programming

Communication complexity

Toniann Pitassi

time complexity

combinatorial optimization

Bron–Kerbosch algorithm

subgraph isomorphism problem

Keller's conjecture

Karp's 21 NP-complete problems

graph isomorphism problem

Circuit complexity

permutation graph

unit disk graph

longest increasing subsequence

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

clique cover problem

Entitydist 0.27

Entitydist 0.41

Entitydist 0.44

subgraph isomorphism problem

Entitydist 0.45

Entitydist 0.51

shortest path problem

Entitydist 0.55

Entitydist 0.57

graph isomorphism

Entitydist 0.59

Entitydist 0.59

Entitydist 0.60

The Weber Problem

Entitydist 0.62

Entitydist 0.63