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

Full description

Bibliographic Details

Published in:	Journal of combinatorial optimization Vol. 44; no. 5; pp. 3701 - 3710
Main Author:	Tsur, Dekel
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2022 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!