A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
From MaRDI portal
Publication:5251652
DOI10.1007/978-3-319-07956-1_26zbMath1445.68180OpenAlexW272170038MaRDI QIDQ5251652
Publication date: 20 May 2015
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-07956-1_26
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
A \(13k\)-kernel for planar feedback vertex set via region decomposition ⋮ Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics
This page was built for publication: A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler