Minimum cost edge subset covering exactly \(k\) vertices of a graph (Q5952317)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1688722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7804986834526062
0 references
0.7804986834526062
0 references
0.7699427604675293
0 references
0.760719358921051
0 references
