On the \(k\)-path partition problem in cographs (Q2716628)
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: On the k-path partition problem in cographs |
scientific article; zbMATH DE number 1599240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(k\)-path partition problem in cographs |
scientific article; zbMATH DE number 1599240 |
Statements
16 May 2001
0 references
path partition
0 references
Hamiltonian path problem
0 references
NP-complete
0 references
threshold graphs
0 references
cographs
0 references
On the \(k\)-path partition problem in cographs (English)
0 references
0.9116076231002808
0 references
0.8359562158584595
0 references
0.8357877731323242
0 references
0.8285988569259644
0 references
0.8188849091529846
0 references
