Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

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

clique cover problem · Vinony

🌐English

English Français Italiano Português Русский فارسی 한국어 中文日本語

EntityQ1096734· pop 9· linked from 18 articles

clique cover problem

problem of finding a minimal clique cover of a given graph

Available in 9 languages

Français
中文
日本語
Русский
Português
Italiano
Ukrainian
فارسی

via Wikidata sitelinks · CC0

Connections

independent set

Categories

Computational problems in graph theory Graph theory objects NP-complete problems

Sources

wikipedia.externallinksexternallink

approximation algorithm

Entity

International Standard Book Number

digital object identifier

P versus NP problem

computational complexity theory

Richard M. Karp

time complexity

decision problem

Sign in to save

What links here18 pages

Karp's 21 NP-complete problems

perfect graph theorem

Similar entities

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

Entitydist 0.27

subgraph isomorphism problem

Entitydist 0.47

Entitydist 0.50

Entitydist 0.51

shortest path problem

Entitydist 0.53

Entitydist 0.55

transitive reduction

Entitydist 0.56

Entitydist 0.57

Entitydist 0.59

graph isomorphism

Entitydist 0.60

Euclidean minimum spanning tree

Entitydist 0.62

The Weber Problem

Entitydist 0.62