A polynomial kernel for $3$-leaf power deletion
In: Algorithmica (2023) 85(10); (2019)
Online
report
Zugriff:
For a non-negative integer $\ell$, the $\ell$-leaf power of a tree $T$ is a simple graph $G$ on the leaves of $T$ such that two vertices are adjacent in $G$ if and only if their distance in $T$ is at most $\ell$. We provide a polynomial kernel for the problem of deciding whether we can delete at most $k$ vertices to make an input graph a $3$-leaf power of some tree. More specifically, we present a polynomial-time algorithm for an input instance $(G,k)$ for the problem to output an equivalent instance $(G',k')$ such that $k'\leq k$ and $G'$ has at most $O(k^{14})$ vertices.
Comment: 28 pages, 1 figure
Titel: |
A polynomial kernel for $3$-leaf power deletion
|
---|---|
Autor/in / Beteiligte Person: | Ahn, Jungho ; Eiben, Eduard ; Kwon, O-joung ; Oum, Sang-il |
Link: | |
Quelle: | Algorithmica (2023) 85(10); (2019) |
Veröffentlichung: | 2019 |
Medientyp: | report |
DOI: | 10.1007/s00453-023-01129-9 |
Schlagwort: |
|
Sonstiges: |
|