A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977)
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 7238340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs |
scientific article; zbMATH DE number 7238340 |
Statements
A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (English)
0 references
24 August 2020
0 references
\(k\)-path vertex cover
0 references
\(k\)-path packing
0 references
computational complexity
0 references
0.8691834211349487
0 references
0.841637134552002
0 references
0.8361276984214783
0 references
0.8356949090957642
0 references
