Faster deterministic parameterized algorithm for k-PATH

Dekel Tsur

doi:10.1016/j.tcs.2019.04.024

Faster deterministic parameterized algorithm for k-PATH

Dekel Tsur

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

Abstract

In the k-PATH problem, the input is a directed graph G and an integer k≥1, and the goal is to decide whether there is a simple directed path in G with exactly k vertices. We give a deterministic algorithm for k-PATH with time complexity O^⁎(2.554^k). This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is O^⁎(2.597^k). The technique used by our algorithm can also be used to obtain faster deterministic algorithms for k-TREE, r-DIMENSIONAL k-MATCHING, GRAPH MOTIF, and PARTIAL COVER.

Original language	English
Pages (from-to)	96-104
Number of pages	9
Journal	Theoretical Computer Science
Volume	790
DOIs	https://doi.org/10.1016/j.tcs.2019.04.024
State	Published - 22 Oct 2019

Keywords

Graph algorithms
Parameterized complexity
k-PATH

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2019.04.024

Cite this

@article{cc2c685c96524d15afe86712e8f70603,

title = "Faster deterministic parameterized algorithm for k-PATH",

abstract = "In the k-PATH problem, the input is a directed graph G and an integer k≥1, and the goal is to decide whether there is a simple directed path in G with exactly k vertices. We give a deterministic algorithm for k-PATH with time complexity O⁎(2.554k). This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is O⁎(2.597k). The technique used by our algorithm can also be used to obtain faster deterministic algorithms for k-TREE, r-DIMENSIONAL k-MATCHING, GRAPH MOTIF, and PARTIAL COVER.",

keywords = "Graph algorithms, Parameterized complexity, k-PATH",

author = "Dekel Tsur",

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

year = "2019",

month = oct,

day = "22",

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

language = "English",

volume = "790",

pages = "96--104",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Faster deterministic parameterized algorithm for k-PATH

AU - Tsur, Dekel

PY - 2019/10/22

Y1 - 2019/10/22

N2 - In the k-PATH problem, the input is a directed graph G and an integer k≥1, and the goal is to decide whether there is a simple directed path in G with exactly k vertices. We give a deterministic algorithm for k-PATH with time complexity O⁎(2.554k). This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is O⁎(2.597k). The technique used by our algorithm can also be used to obtain faster deterministic algorithms for k-TREE, r-DIMENSIONAL k-MATCHING, GRAPH MOTIF, and PARTIAL COVER.

AB - In the k-PATH problem, the input is a directed graph G and an integer k≥1, and the goal is to decide whether there is a simple directed path in G with exactly k vertices. We give a deterministic algorithm for k-PATH with time complexity O⁎(2.554k). This improves the previously best deterministic algorithm for this problem of Zehavi [ESA 2015] whose time complexity is O⁎(2.597k). The technique used by our algorithm can also be used to obtain faster deterministic algorithms for k-TREE, r-DIMENSIONAL k-MATCHING, GRAPH MOTIF, and PARTIAL COVER.

KW - Graph algorithms

KW - Parameterized complexity

KW - k-PATH

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

U2 - 10.1016/j.tcs.2019.04.024

DO - 10.1016/j.tcs.2019.04.024

M3 - Article

SN - 0304-3975

VL - 790

SP - 96

EP - 104

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Faster deterministic parameterized algorithm for k-PATH

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this