Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth (Q6969500)
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 8054683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth |
scientific article; zbMATH DE number 8054683 |
Statements
Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth (English)
0 references
20 June 2025
0 references
path cover
0 references
trees
0 references
treewidth
0 references
0 references
0 references
0 references
