A 5k-vertex kernel for 3-path vertex cover

Theoretical Computer Science（2023）

引用 0|浏览0

暂无评分

摘要

A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most k. We give a kernel of 5k vertices for this problem, improving the previously known bounds.

查看译文

关键词

Graph algorithms,Kernelization,Parameterized algorithms,3-Path vertex cover

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要