Work

Faster algorithms for 3-leaf power modification problems

Year: 2025

Type: article

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 $$O^*(4.237^k)$$ -time algorithms for 3-Leaf Power Vertex Deletion and 3-Leaf Power Edge Deletion .

Source: Journal of Combinatorial Optimization

DOI: 10.1007/s10878-025-01378-0

Author: Dekel Tsur

Institution: Ben-Gurion University of the Negev

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,190

Funder: Ben-Gurion University of the Negev