Faster algorithms for 3-leaf power modification problems

DOI10.1007/S10878-025-01378-0MaRDI QIDQ6868572zbMATH OpenFDO

Authors Dekel Tsur

Publication date 23 January 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

graph algorithmsparameterized complexitybranching algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Cites work

• A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
• A polynomial kernel for 3-leaf power deletion
• A survey of parameterized algorithms and the complexity of edge modification
• Closest 4-leaf power is fixed-parameter tractable
• Error compensation in leaf power problems
• Linear-time algorithms for tree root problems
• On graph powers for leaf-labeled trees
• Parameterized algorithms
• Polynomial kernels for 3-leaf power graph modification problems
• Recognizing k -Leaf Powers in Polynomial Time, for Constant k
• Smaller kernels for 3-leaf power modifications problems
• The 4-Steiner Root problem
• The node-deletion problem for hereditary properties is NP-complete

This page was built for publication: Faster algorithms for 3-leaf power modification problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6868572)