Faster algorithm for pathwidth one vertex deletion

Research output: Contribution to journalArticlepeer-review

Abstract

In the PATHWIDTH ONE VERTEX DELETION (POVD) 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 with pathwidth at most 1. In this paper we give an algorithm for POVD whose running time is O(3.888k).

Original languageEnglish
Pages (from-to)63-74
Number of pages12
JournalTheoretical Computer Science
Volume921
DOIs
StatePublished - 19 Jun 2022

Keywords

  • Branching algorithms
  • Graph algorithms
  • Parameterized complexity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Faster algorithm for pathwidth one vertex deletion'. Together they form a unique fingerprint.

Cite this