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

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 languageEnglish
Pages (from-to)3701-3710
Number of pages10
JournalJournal of Combinatorial Optimization
Volume44
Issue number5
DOIs
StatePublished - 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

Fingerprint

Dive into the research topics of 'Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing'. Together they form a unique fingerprint.

Cite this