Abstract
In the 3-Leaf Power Vertex Deletion (resp., 3-Leaf Power Edge Deletion) 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 (resp., edges) whose removal from G results in a graph that is a 3-leaf power. In this paper we give -time algorithms for 3-Leaf Power Vertex Deletion and 3-Leaf Power Edge Deletion.
| Original language | English |
|---|---|
| Article number | 47 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 50 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 Dec 2025 |
Keywords
- Branching algorithms
- Graph algorithms
- Parameterized complexity
ASJC Scopus subject areas
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Control and Optimization
- Computational Theory and Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Faster algorithms for 3-leaf power modification problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver