Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Vertex and edge covers with clustering properties: Complexity and algorithms |
scientific article; zbMATH DE number 5569513
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex and edge covers with clustering properties: Complexity and algorithms |
scientific article; zbMATH DE number 5569513 |
Statements
Vertex and edge covers with clustering properties: Complexity and algorithms (English)
0 references
24 June 2009
0 references
\(t\)-total vertex cover
0 references
connected vertex cover
0 references
\(t\)-total edge cover
0 references
polynomial-time algorithm
0 references
NP-completeness
0 references
approximation algorithm
0 references
FPT algorithm
0 references
0 references
0 references
