Faster parameterized algorithm for pumpkin vertex deletion set

Research output: Contribution to journalArticlepeer-review


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 languageAmerican English
Pages (from-to)74-76
Number of pages3
JournalInformation Processing Letters
StatePublished - 1 Jul 2019


  • Branching algorithms
  • Graph algorithms
  • Parameterized complexity

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Faster parameterized algorithm for pumpkin vertex deletion set'. Together they form a unique fingerprint.

Cite this