An O(2.619k) algorithm for 4-PATH VERTEX COVER

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


In the 4-PATH VERTEX COVER problem, the input is an undirected graph G and an integer k. The goal is to decide whether there is a set S of vertices of size at most k such that every path with 4 vertices in G contains at least one vertex of S. In this paper we give a parameterized algorithm for 4-PATH VERTEX COVER whose time complexity is 2.619k⋅nO(1), where n denotes the number of vertices of the input graph.

Original languageEnglish
Pages (from-to)1-14
Number of pages14
JournalDiscrete Applied Mathematics
StatePublished - 11 Mar 2021


  • Branching rules
  • Graph algorithms
  • Iterative compression
  • Parameterized complexity

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'An O(2.619k) algorithm for 4-PATH VERTEX COVER'. Together they form a unique fingerprint.

Cite this