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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization Jg. 44; H. 5; S. 3701 - 3710
1. Verfasser:	Tsur, Dekel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.12.2022 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!