Polynomial kernels for 3-leaf power graph modification problems |
| |
Authors: | Stéphane Bessy |
| |
Institution: | a CNRS - LIRMM, Université Montpellier 2, 161 rue Ada 34932 Montpellier, Franceb LIRMM - Université Montpellier 2, 161 rue Ada 34932 Montpellier, France |
| |
Abstract: | A graph G=(V,E) is a 3-leaf power iff there exists a tree T the leaf set of which is V and such that uv∈E iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the closest 3-leaf power), completion and edge-deletion are FPT when parameterized by the size of the edge set modification. However, polynomial kernels were known for none of these three problems. For each of them, we provide kernels with O(k3) vertices that can be computed in linear time. We thereby answer an open problem first mentioned by Dom et al. (2004) 8]. |
| |
Keywords: | Algorithms Data-structures FPT Kernel Graph modification problems Leaf power |
本文献已被 ScienceDirect 等数据库收录! |
|