Faster deterministic algorithm for Co-Path Set

Research output: Contribution to journalArticlepeer-review


In the CO-PATH SET 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 edges whose removal from G results in a graph in which every connected component is a path. In this paper we give a deterministic O(2k)-time algorithm for CO-PATH SET.

Original languageEnglish
Article number106335
JournalInformation Processing Letters
StatePublished - 1 Feb 2023


  • Branching algorithms
  • Graph algorithms
  • Parameterized complexity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Faster deterministic algorithm for Co-Path Set'. Together they form a unique fingerprint.

Cite this