Faster parameterized algorithm for pumpkin vertex deletion set

Dekel Tsur

doi:10.1016/j.ipl.2019.03.009

Faster parameterized algorithm for pumpkin vertex deletion set

Dekel Tsur

Department of Computer Science

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

2 Scopus citations

Abstract

A directed graph G is called a pumpkin if G is a union of induced directed paths with a common start vertex s and a common end vertex t, and the internal vertices of every two paths are disjoint. We give an algorithm that given a directed graph G and an integer k, decides whether a pumpkin can be obtained from G by deleting at most k vertices. The algorithm runs in O ^⁎ (2 ^k ) time.

Original language	English
Pages (from-to)	74-76
Number of pages	3
Journal	Information Processing Letters
Volume	147
DOIs	https://doi.org/10.1016/j.ipl.2019.03.009
State	Published - 1 Jul 2019

Keywords

Branching algorithms
Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2019.03.009

Cite this

@article{d204a736184341358e79f574572cd2b1,

title = "Faster parameterized algorithm for pumpkin vertex deletion set",

abstract = " A directed graph G is called a pumpkin if G is a union of induced directed paths with a common start vertex s and a common end vertex t, and the internal vertices of every two paths are disjoint. We give an algorithm that given a directed graph G and an integer k, decides whether a pumpkin can be obtained from G by deleting at most k vertices. The algorithm runs in O ⁎ (2 k ) time.",

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

author = "Dekel Tsur",

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

year = "2019",

month = jul,

day = "1",

doi = "10.1016/j.ipl.2019.03.009",

language = "English",

volume = "147",

pages = "74--76",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

}

TY - JOUR

T1 - Faster parameterized algorithm for pumpkin vertex deletion set

AU - Tsur, Dekel

PY - 2019/7/1

Y1 - 2019/7/1

N2 - A directed graph G is called a pumpkin if G is a union of induced directed paths with a common start vertex s and a common end vertex t, and the internal vertices of every two paths are disjoint. We give an algorithm that given a directed graph G and an integer k, decides whether a pumpkin can be obtained from G by deleting at most k vertices. The algorithm runs in O ⁎ (2 k ) time.

AB - A directed graph G is called a pumpkin if G is a union of induced directed paths with a common start vertex s and a common end vertex t, and the internal vertices of every two paths are disjoint. We give an algorithm that given a directed graph G and an integer k, decides whether a pumpkin can be obtained from G by deleting at most k vertices. The algorithm runs in O ⁎ (2 k ) time.

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

UR - http://www.scopus.com/inward/record.url?scp=85063430319&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2019.03.009

DO - 10.1016/j.ipl.2019.03.009

M3 - Article

AN - SCOPUS:85063430319

SN - 0020-0190

VL - 147

SP - 74

EP - 76

JO - Information Processing Letters

JF - Information Processing Letters

ER -

Faster parameterized algorithm for pumpkin vertex deletion set

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this