Faster algorithm for pathwidth one vertex deletion

Dekel Tsur

doi:10.1016/j.tcs.2022.04.001

Faster algorithm for pathwidth one vertex deletion

Dekel Tsur

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

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.888^k).

Original language	English
Pages (from-to)	63-74
Number of pages	12
Journal	Theoretical Computer Science
Volume	921
DOIs	https://doi.org/10.1016/j.tcs.2022.04.001
State	Published - 19 Jun 2022

Keywords

Branching algorithms
Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2022.04.001

Cite this

@article{baf3e05e2e594ebfbdf0af6a4b233198,

title = "Faster algorithm for pathwidth one vertex deletion",

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).",

keywords = "Branching algorithms, Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier B.V.",

year = "2022",

month = jun,

day = "19",

doi = "10.1016/j.tcs.2022.04.001",

language = "English",

volume = "921",

pages = "63--74",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Faster algorithm for pathwidth one vertex deletion

AU - Tsur, Dekel

PY - 2022/6/19

Y1 - 2022/6/19

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

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

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

UR - https://www.scopus.com/pages/publications/85128198269

U2 - 10.1016/j.tcs.2022.04.001

DO - 10.1016/j.tcs.2022.04.001

M3 - Article

AN - SCOPUS:85128198269

SN - 0304-3975

VL - 921

SP - 63

EP - 74

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Faster algorithm for pathwidth one vertex deletion

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this