Dekel Tsur
Senior Academic
Faster algorithms for 3-leaf power modification problems
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.
| Publication language | English |
| Journal | Journal of Combinatorial Optimization |
| Volume | 50 |
| Issue number | 5 |
| Publication status | Published - 01.12.2025 |
| Article Number | 47 |
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
