Polynomial-time algorithms for \textsc{Path Cover} and \textsc{Path Partition} on trees and graphs of bounded treewidth

Cites work

A linear algorithm for the Hamiltonian completion number of a tree
A single-exponential time 2-approximation algorithm for treewidth
An optimal path cover algorithm for cographs
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Graph minors. XIII: The disjoint paths problem
scientific article; zbMATH DE number 3694608 (Why is no real title available?)
scientific article; zbMATH DE number 3465355 (Why is no real title available?)
scientific article; zbMATH DE number 3467157 (Why is no real title available?)
scientific article; zbMATH DE number 3404271 (Why is no real title available?)
Intractability of clique-width parameterizations
Introduction to algorithms.
LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
On Path Cover Problems in Digraphs and Applications to Program Testing
Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
Parameterized algorithms
Parameterizing path partitions
Path covering problems and testing of printed circuits
Path partition for graphs with special blocks
Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time
The Fine Details of Fast Dynamic Programming over Tree Decompositions
Treewidth. Computations and approximations
Vertex covering by paths on trees with its applications in machine translation

This page was built for publication: Polynomial-time algorithms for \textsc{Path Cover} and \textsc{Path Partition} on trees and graphs of bounded treewidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396337)