An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion


The Pathwidth One Vertex Deletion (POVD) problem asks whether, given an undirected graph G and an integer k, one can delete at most k vertices from G so that the remaining graph has pathwidth at most 1. The question can be considered as a natural variation of the extensively studied Feedback Vertex Set (FVS) problem, where the deletion of at most k vertices… (More)
DOI: 10.1007/s00453-011-9578-2

4 Figures and Tables


  • Presentations referencing similar topics