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 条
  • [1] r-Simple k-Path and Related Problems Parameterized by k/r
    Gutin, Gregory
    Wahlstrom, Magnus
    Zehavi, Meirav
    ACM TRANSACTIONS ON ALGORITHMS, 2021, 17 (01)
  • [2] On a relation between k-path partition and k-path vertex cover
    Brause, Christoph
    Krivos-Bellus, Rastislav
    DISCRETE APPLIED MATHEMATICS, 2017, 223 : 28 - 38
  • [3] A local search algorithm for the k-path partition problem
    Shiming Li
    Wei Yu
    Zhaohui Liu
    Optimization Letters, 2024, 18 : 279 - 290
  • [4] A local search algorithm for the k-path partition problem
    Li, Shiming
    Yu, Wei
    Liu, Zhaohui
    OPTIMIZATION LETTERS, 2024, 18 (01) : 279 - 290
  • [5] Approximation Algorithm for the Broadcast Time in k-Path Graph
    Bhabak, Puspal
    Harutyunyan, Hovhannes A.
    JOURNAL OF INTERCONNECTION NETWORKS, 2019, 19 (04)
  • [6] A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs
    D. B. Mokeev
    D. S. Malyshev
    Optimization Letters, 2020, 14 : 1317 - 1322
  • [7] Faster deterministic algorithm for Co-Path Set
    Tsur, Dekel
    INFORMATION PROCESSING LETTERS, 2023, 180
  • [8] k-path partitions in trees
    Yan, JH
    Chang, GJ
    Hedetniemi, SM
    Hedetniemi, ST
    DISCRETE APPLIED MATHEMATICS, 1997, 78 (1-3) : 227 - 233
  • [9] A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs
    Mokeev, D. B.
    Malyshev, D. S.
    OPTIMIZATION LETTERS, 2020, 14 (06) : 1317 - 1322
  • [10] Concatenated k-path covers
    Beck, Moritz
    Lam, Kam-Yiu
    Ng, Joseph Kee Yin
    Storandt, Sabine
    Zhu, Chun Jiang
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2023, 8 (01) : 32 - 56
12345