Minimum cost edge subset covering exactly \(k\) vertices of a graph (Q5952317)
From MaRDI portal
scientific article; zbMATH DE number 1688722
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum cost edge subset covering exactly \(k\) vertices of a graph |
scientific article; zbMATH DE number 1688722 |
Statements
Minimum cost edge subset covering exactly \(k\) vertices of a graph (English)
0 references
2001
0 references
edge cover
0 references
polynomial algorithm
0 references
