2026-08-06T03:48:31Z https://drops.dagstuhl.de/oai
oai:drops-oai.dagstuhl.de:12676 2024-03-06T10:50:32Z ddc:004 open_access
A Polynomial Kernel for 3-Leaf Power Deletion Ahn, Jungho Eiben, Eduard Kwon, O-joung Oum, Sang-il 𝓁-leaf power parameterized algorithms kernelization For a non-negative integer 𝓁, a graph G is an 𝓁-leaf power of a tree T if V(G) is equal to the set of leaves of T, and distinct vertices v and w of G are adjacent if and only if the distance between v and w in T is at most 𝓁. Given a graph G, 3-Leaf Power Deletion asks whether there is a set S βŠ† V(G) of size at most k such that G\S is a 3-leaf power of some treeT. We provide a polynomial kernel for this problem. More specifically, we present a polynomial-time algorithm for an input instance (G,k) to output an equivalent instance (G',k') such that k'≀ k and G' has at most O(k^14) vertices. Schloss Dagstuhl – Leibniz-Zentrum fΓΌr Informatik Jungho Ahn and Eduard Eiben and O-joung Kwon and Sang-il Oum 2020 Is Part Of LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2020.5 urn:nbn:de:0030-drops-126763 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.5 eng https://creativecommons.org/licenses/by/3.0/legalcode