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 条

[31] A genetic algorithm using K-path initialization for community detection in complex networks
Meng, Xiangyu
Dong, Liyan
Li, Yongli
Guo, William W.
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2017, 20 (01): : 311 - 320
[32] Reconfiguring k-Path Vertex Covers
Hoang, Duc A.
Suzuki, Akira
Yagita, Tsuyoshi
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2022, E105D (07): : 1258 - 1272
[33] Generating and counting unlabeled k-path graphs
da Costa Pereira, Paulo Renato
Garcia, Alex
Markenzon, Lilian
DISCRETE APPLIED MATHEMATICS, 2014, 164 : 297 - 303
[34] A Survey on the k-Path Vertex Cover Problem
Tu, Jianhua
AXIOMS, 2022, 11 (05)
[35] On the weighted k-path vertex cover problem
Bresar, B.
Krivos-Bellus, R.
Semanisin, G.
Sparl, P.
DISCRETE APPLIED MATHEMATICS, 2014, 177 : 14 - 18
[36] Faster parameterized algorithm for BICLUSTER EDITING
Tsur, Dekel
INFORMATION PROCESSING LETTERS, 2021, 168
[37] A faster parameterized algorithm for temporal matching
Zschoche, Philipp
INFORMATION PROCESSING LETTERS, 2022, 174
[38] A faster parameterized algorithm for PSEUDOFOREST DELETION
Bodlaender, Hans L.
Ono, Hirotaka
Otachi, Yota
DISCRETE APPLIED MATHEMATICS, 2018, 236 : 42 - 56
[39] A faster parameterized algorithm for set packing
Koutis, I
INFORMATION PROCESSING LETTERS, 2005, 94 (01) : 7 - 9
[40] On the minimum vertex k-path cover of trees
Lemanska, Magdalena
UTILITAS MATHEMATICA, 2016, 100 : 299 - 307

← 1 2 3 4 5 →