مسألة العُصْبة
Sign in to saveAlso known as maximum clique problem
computational problem of finding cliques in a graph
In the Vinony graph
Within Vinony's link graph, مسألة العُصْبة is referenced by 64 other articles, and connects out to glossary of graph theory terms, P versus NP problem and big O notation.
Vinony files it under Computational problems in graph theory and NP-complete problems.
Its subject is documented across 18 Wikipedia language editions.
Wikidata facts
- Instance of
- computational problem
Show 2 more facts
- opposite of
- maximum independent set problem
- computational complexity
- NP-complete
Sources (2)
via Wikidata · CC0
Connections
glossary of graph theory terms
Entity
P versus NP problem
Entity
big O notation
Entity
time complexity
Entity
clique
Entity
graph
Entity
Springer Science+Business Media
Entity
truth value
Entity
NP-complete
Entity
boolean satisfiability problem
Entity
complement graph
Entity
independent set
Entity
lexicographical order
Entity
approximation algorithm
Entity
parameterized complexity
Entity
decision tree model
Entity
chemistry
Entity
computer science
Entity
International Standard Book Number
Entity
algorithm
Entity