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

Podrobná bibliografie

Vydáno v:	Journal of combinatorial optimization Ročník 44; číslo 5; s. 3701 - 3710
Hlavní autor:	Tsur, Dekel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.12.2022 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!