Faster deterministic parameterized algorithm for k-PATH

被引：9
|
作者：
Tsur, Dekel [1 ]
机构：
[1] Ben Gurion Univ Negev, Dept Comp Sci, Beer Sheva, Israel
来源：
THEORETICAL COMPUTER SCIENCE | 2019年 / 790卷
关键词：
Graph algorithms; k-PATH; Parameterized complexity;
D O I：
10.1016/j.tcs.2019.04.024
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 0*(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. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码：96 / 104
页数：9
相关论文
共 50 条
  • [41] SUFFICIENT CONDITION FOR K-PATH HAMILTONIAN DIGRAPHS
    ROBERTS, J
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 82 (01) : 63 - 65
  • [42] ON K-PATH HAMILTONIAN MAXIMAL PLANAR GRAPHS
    BAYBARS, I
    DISCRETE MATHEMATICS, 1982, 40 (01) : 119 - 121
  • [43] The k-path vertex cover of rooted product graphs
    Jakovac, Marko
    DISCRETE APPLIED MATHEMATICS, 2015, 187 : 111 - 119
  • [44] Adaptive Algorithms for Estimating Betweenness and k-path Centralities
    Chehreghani, Mostafa Haghir
    Bifet, Albert
    Abdessalem, Talel
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, : 1231 - 1240
  • [45] Planar k-Path in Subexponential Time and Polynomial Space
    Lokshtanov, Daniel
    Mnich, Matthias
    Saurabh, Saket
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2011, 6986 : 262 - +
  • [46] Optimizing k-path selection for randomized interconnection networks
    Newaz, Md Nahid
    Mollah, Md Atiqul
    2021 IEEE 28TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, DATA, AND ANALYTICS (HIPC 2021), 2021, : 222 - 231
  • [47] Complexity of the Maximum k-Path Vertex Cover Problem
    Miyano, Eiji
    Saitoh, Toshiki
    Uehara, Ryuhei
    Yagita, Tsuyoshi
    van der Zanden, Tom C.
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2020, E103A (10) : 1193 - 1201
  • [48] Faster Parameterized Algorithm for Cluster Vertex Deletion
    Tsur, Dekel
    THEORY OF COMPUTING SYSTEMS, 2021, 65 (02) : 323 - 343
  • [49] Complexity of the Maximum k-Path Vertex Cover Problem
    Miyano, Eiji
    Saitoh, Toshiki
    Uehara, Ryuhei
    Yagita, Tsuyoshi
    van der Zanden, Tom C.
    WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2018, 2018, 10755 : 240 - 251
  • [50] Faster Parameterized Algorithm for Cluster Vertex Deletion
    Dekel Tsur
    Theory of Computing Systems, 2021, 65 : 323 - 343
12345