Minimum \(k\)-path vertex cover (Q2275922)
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: Minimum k-path vertex cover |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum \(k\)-path vertex cover |
scientific article |
Statements
Minimum \(k\)-path vertex cover (English)
0 references
10 August 2011
0 references
algorithm
0 references
path
0 references
vertex cover
0 references
dissociation number
0 references
path vertex cover
0 references
NP-complete
0 references
0.8962666392326355
0 references
0.8953155279159546
0 references
0.8903735280036926
0 references
0.8796262145042419
0 references
0.879574179649353
0 references
