vertex cover problem
set of vertices incident on every edge
Facts
5 properties- Instance of
- computational problem
- Facet of
- minimum vertex cover[3]
- Computational complexity
- NP-complete[5]
- Different from
- vertex cover[4]
🏷️ Also known as
en vertex cover problem
de Knotenüberdeckungsproblem
fa پوشش راس
fa پوشش گرهای
fr problème de couverture de sommets
fr problème de couverture minimum par sommets
fr problème du transversal minimum
he בעיית כיסוי קודקודים
hu lefogó ponthalmaz
hu csúcslefedés
hu csúcslefedés-probléma
hu lefogó csúcshalmaz
id Tutup verteks
it problema di copertura dei vertici
ja 頂点被覆問題
nl knopenbedekkingsprobleem
nl toppenbedekkingsprobleem
pl problem pokrycia wierzchołkowego
pt problema da cobertura de vértices
ru задача о вершинном покрытии
🔖 Identifiers · 2
- Freebase ID
- /m/022rkw
- Google Knowledge Graph ID
- /g/121873xz
🔗 Connections
Belongs to 1
Computational complexity 1
Different from 1
Instance of 1
Part of 1
← Different from 1
Press Enter · cited answer in seconds
0 sources
Summary
vertex cover problem is a computational problem[1].