Parameterized algorithm for 3-path vertex cover

Dekel Tsur

doi:10.1016/j.tcs.2019.03.013

Parameterized algorithm for 3-path vertex cover

Dekel Tsur

Department of Computer Science

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

24 Scopus citations

Abstract

In the 3-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 of vertices S of size at most k such that every path with 3 vertices in G contains at least one vertex of S. In this paper we give a parameterized algorithm for 3-path vertex cover whose time complexity is O^⁎(1.713^k). Our algorithm is faster than previous algorithms for this problem.

Original language	English
Pages (from-to)	1-8
Number of pages	8
Journal	Theoretical Computer Science
Volume	783
DOIs	https://doi.org/10.1016/j.tcs.2019.03.013
State	Published - 6 Sep 2019

Keywords

3-path vertex cover
Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2019.03.013

Cite this

@article{452c6f3605c34cd392c229b83d2994c0,

title = "Parameterized algorithm for 3-path vertex cover",

abstract = "In the 3-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 of vertices S of size at most k such that every path with 3 vertices in G contains at least one vertex of S. In this paper we give a parameterized algorithm for 3-path vertex cover whose time complexity is O⁎(1.713k). Our algorithm is faster than previous algorithms for this problem.",

keywords = "3-path vertex cover, Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

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

year = "2019",

month = sep,

day = "6",

doi = "10.1016/j.tcs.2019.03.013",

language = "English",

volume = "783",

pages = "1--8",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - Parameterized algorithm for 3-path vertex cover

AU - Tsur, Dekel

PY - 2019/9/6

Y1 - 2019/9/6

N2 - In the 3-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 of vertices S of size at most k such that every path with 3 vertices in G contains at least one vertex of S. In this paper we give a parameterized algorithm for 3-path vertex cover whose time complexity is O⁎(1.713k). Our algorithm is faster than previous algorithms for this problem.

AB - In the 3-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 of vertices S of size at most k such that every path with 3 vertices in G contains at least one vertex of S. In this paper we give a parameterized algorithm for 3-path vertex cover whose time complexity is O⁎(1.713k). Our algorithm is faster than previous algorithms for this problem.

KW - 3-path vertex cover

KW - Graph algorithms

KW - Parameterized complexity

UR - http://www.scopus.com/inward/record.url?scp=85062971407&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2019.03.013

DO - 10.1016/j.tcs.2019.03.013

M3 - Article

AN - SCOPUS:85062971407

SN - 0304-3975

VL - 783

SP - 1

EP - 8

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Parameterized algorithm for 3-path vertex cover

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this