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

Dekel Tsur

doi:10.1016/j.dam.2020.11.019

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

Dekel Tsur

Research output: Contribution to journal › Article › peer-review

Abstract

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.619^k⋅n^O(1), where n denotes the number of vertices of the input graph.

Original language	English
Pages (from-to)	1-14
Number of pages	14
Journal	Discrete Applied Mathematics
Volume	291
DOIs	https://doi.org/10.1016/j.dam.2020.11.019
State	Published - 11 Mar 2021

Keywords

Branching rules
Graph algorithms
Iterative compression
Parameterized complexity

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2020.11.019

Cite this

@article{754cc8a3722f49e9a2bc96c580536801,

title = "An O∗(2.619k) algorithm for 4-PATH VERTEX COVER",

abstract = "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.",

keywords = "Branching rules, Graph algorithms, Iterative compression, Parameterized complexity",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2021",

month = mar,

day = "11",

doi = "10.1016/j.dam.2020.11.019",

language = "English",

volume = "291",

pages = "1--14",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

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

AU - Tsur, Dekel

PY - 2021/3/11

Y1 - 2021/3/11

N2 - 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.

AB - 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.

KW - Branching rules

KW - Graph algorithms

KW - Iterative compression

KW - Parameterized complexity

UR - https://www.scopus.com/pages/publications/85097586879

U2 - 10.1016/j.dam.2020.11.019

DO - 10.1016/j.dam.2020.11.019

M3 - Article

SN - 0166-218X

VL - 291

SP - 1

EP - 14

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -