Faster deterministic algorithm for Co-Path Set

被引:0
|
作者
Tsur, Dekel [1 ]
机构
[1] Ben Gurion Univ Negev, Dept Comp Sci, Beer Sheva, Israel
关键词
Graph algorithms; Parameterized complexity; Branching algorithms; RADIATION HYBRID MAP;
D O I
10.1016/j.ipl.2022.106335
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the CO-PATH SET problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k edges whose removal from G results in a graph in which every connected component is a path. In this paper we give a deterministic O*(2k)-time algorithm for CO-PATH SET.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:3
相关论文
共 50 条
  • [31] Making path selection faster: a routing algorithm for ONoC
    Zhu, Lijing
    Gu, Huaxi
    Yang, Yintang
    Chen, Yawen
    OPTICS EXPRESS, 2021, 29 (07) : 10221 - 10235
  • [33] Faster algorithm for the set variant of the string barcoding problem
    Gasieniec, Leszek
    Li, Cindy Y.
    Zhang, Meng
    COMBINATORIAL PATTERN MATCHING, 2008, 5029 : 82 - +
  • [34] A Faster Parameterized Algorithm for Group Feedback Edge Set
    Ramanujan, M. S.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 269 - 281
  • [35] Optical System Design for Multi-Spectral Laser Radar with Refraction and Reflection in Co-Path
    Li Jing
    Che Ying
    Wang Jiaan
    Jin Meishan
    Luan Shuang
    CHINESE JOURNAL OF LASERS-ZHONGGUO JIGUANG, 2018, 45 (05):
  • [36] Faster deterministic dictionaries
    Pagh, R
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 487 - 493
  • [37] Deterministic algorithm for the t-Threshold set problem
    Barbay, J
    Kenyon, C
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 575 - 584
  • [38] Optical system design of a co-path Doppler asymmetric spatial heterodyne interferometer with two fields of view
    Fei, Xiaoyun
    Feng, Yutao
    Bai, Qinglan
    Xie, Nian
    Li, Yong
    Yan, Peng
    Sun, Jian
    Guangxue Xuebao/Acta Optica Sinica, 2015, 35 (04):
  • [39] A Faster Algorithm for RNA Co-folding
    Ziv-Ukelson, Michal
    Gat-Viks, Irit
    Wexler, Ydo
    Shamir, Ron
    ALGORITHMS IN BIOINFORMATICS, WABI 2008, 2008, 5251 : 174 - +
  • [40] A faster FPT algorithm for 3-path vertex cover
    Katrenic, Jan
    INFORMATION PROCESSING LETTERS, 2016, 116 (04) : 273 - 278