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