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 | |
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