Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
From MaRDI portal
Publication:2911621
DOI10.4230/LIPIcs.FSTTCS.2011.164zbMath1246.68130OpenAlexW1493606949MaRDI QIDQ2911621
Fedor V. Fomin, Yngve Villanger, Geevarghese Philip
Publication date: 31 August 2012
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2011.164
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
