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

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 p...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of combinatorial optimization Ročník 44; číslo 5; s. 3701 - 3710
Hlavný autor: Tsur, Dekel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.12.2022
Springer Nature B.V
Predmet:
Algorithms
Apexes
Combinatorics
Convex and Discrete Geometry
Graph theory
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Theory of Computation
Parameterized complexity
Branching algorithms
Graph algorithms
ISSN:1382-6905, 1573-2886
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 .
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-022-00917-3