scientific article; zbMATH DE number 7051178
From MaRDI portal
Publication:4633817
zbMath1422.68144MaRDI QIDQ4633817
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496783
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (9)
Kernelization for feedback vertex set via elimination distance to a forest ⋮ A naive algorithm for feedback vertex set ⋮ Confronting intractability via parameters ⋮ On parameterized independent feedback vertex set ⋮ A linear kernel for a planar connected dominating set ⋮ On the small cycle transversal of planar graphs ⋮ On problems without polynomial kernels ⋮ Kernelization: New Upper and Lower Bound Techniques ⋮ Backdoors to tractable answer set programming
This page was built for publication:
