Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing

Dekel Tsur

doi:10.1007/s10878-022-00917-3

Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing

Dekel Tsur

Department of Computer Science

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

Abstract

In the Co-path Packing (resp., Co-path/cycle Packing) 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 vertices whose removal from G results in a graph which is a collection of induced paths (resp., induced paths and cycles). In this paper we give deterministic O^∗(3 ^k) -time algorithms for Co-path Packing and Co-path/cycle Packing.

Original language	English
Pages (from-to)	3701-3710
Number of pages	10
Journal	Journal of Combinatorial Optimization
Volume	44
Issue number	5
DOIs	https://doi.org/10.1007/s10878-022-00917-3
State	Published - 1 Dec 2022

Keywords

Branching algorithms
Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Computer Science Applications
Discrete Mathematics and Combinatorics
Control and Optimization
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1007/s10878-022-00917-3

Cite this

@article{c7696e58cb8f4346a4450b32a887bcff,

title = "Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing",

abstract = "In the Co-path Packing (resp., Co-path/cycle Packing) 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 vertices whose removal from G results in a graph which is a collection of induced paths (resp., induced paths and cycles). In this paper we give deterministic O∗(3 k) -time algorithms for Co-path Packing and Co-path/cycle Packing.",

keywords = "Branching algorithms, Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2022",

month = dec,

day = "1",

doi = "10.1007/s10878-022-00917-3",

language = "English",

volume = "44",

pages = "3701--3710",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "5",

}

TY - JOUR

T1 - Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing

AU - Tsur, Dekel

PY - 2022/12/1

Y1 - 2022/12/1

N2 - In the Co-path Packing (resp., Co-path/cycle Packing) 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 vertices whose removal from G results in a graph which is a collection of induced paths (resp., induced paths and cycles). In this paper we give deterministic O∗(3 k) -time algorithms for Co-path Packing and Co-path/cycle Packing.

AB - In the Co-path Packing (resp., Co-path/cycle Packing) 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 vertices whose removal from G results in a graph which is a collection of induced paths (resp., induced paths and cycles). In this paper we give deterministic O∗(3 k) -time algorithms for Co-path Packing and Co-path/cycle Packing.

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

UR - http://www.scopus.com/inward/record.url?scp=85139219511&partnerID=8YFLogxK

U2 - 10.1007/s10878-022-00917-3

DO - 10.1007/s10878-022-00917-3

M3 - Article

AN - SCOPUS:85139219511

SN - 1382-6905

VL - 44

SP - 3701

EP - 3710

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 5

ER -

Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this