FPT-space Graph Kernelizations. (arXiv:2007.11643v1 [cs.DS])
Let be the size of a parametrized problem and the parameter. We present polynomial-time kernelizations for Cluster Editing/Deletion, Path Contractions and Feedback Vertex Set that run with bits and compute a kernel of size polynomial in . By first executing the new kernelizations and subsequently the best known polynomial-time kernelizations for the problem under consideration, we obtain the best known kernels in polynomial time with bits.
Our kernelization for Feedback Vertex Set computes in a first step an approximated solution, which can be used to build a simple algorithm for undirected --connectivity (USTCON) that runs in polynomial time and with bits.
Publisher URL: http://arxiv.org/abs/2007.11643
DOI: arXiv:2007.11643v1
Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.
Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.