Space-Efficient Graph Kernelizations
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914686457348096 |
|---|---|
| author | Kammer, Frank Sajenko, Andrej |
| author_facet | Kammer, Frank Sajenko, Andrej |
| contents | Let $n$ be the size of a parameterized problem and $k$ the parameter. We present kernels for Feedback Vertex Set, Path Contraction and Cluster Editing/Deletion whose sizes are all polynomial in $k$ and that are computable in polynomial time and with $O(\rm{poly}(k) \log n)$ bits (of working memory). By using kernel cascades, we obtain the best known kernels in polynomial time with $O(\rm{poly}(k) \log n)$ bits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2007_11643 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Space-Efficient Graph Kernelizations Kammer, Frank Sajenko, Andrej Data Structures and Algorithms Let $n$ be the size of a parameterized problem and $k$ the parameter. We present kernels for Feedback Vertex Set, Path Contraction and Cluster Editing/Deletion whose sizes are all polynomial in $k$ and that are computable in polynomial time and with $O(\rm{poly}(k) \log n)$ bits (of working memory). By using kernel cascades, we obtain the best known kernels in polynomial time with $O(\rm{poly}(k) \log n)$ bits. |
| title | Space-Efficient Graph Kernelizations |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2007.11643 |