Conceptio › Archive › HAL (France)
HAL (France)open access

Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth

Florent Foucaud et al.
HAL (France) · Papers · License: Open Access
Open Source ↗
trees
0, 1, Path Cover, Treewidth, Path Partition, Trees
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 677074
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.