Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
From MaRDI portal
Publication:6670351
DOI10.1137/22m152058xMaRDI QIDQ6670351
Bart M. P. Jansen, Michał Włodarczyk
Publication date: 23 January 2025
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
