An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth

Zongwen Bai, Jianhua Tu, Yongtang Shi

Given a graph $G=(V,E)$ and a positive integer $t\ge 2$, the task in the vertex cover $P_t$ ($VC{P}_t$) problem is to find a minimum subset of vertices $F\subseteq V$ such that every…