Faster parameterized algorithms for \textsc{Minimum Fill-in}
From MaRDI portal
Publication:652537
DOI10.1007/s00453-010-9421-1zbMath1230.68100WikidataQ59567595 ScholiaQ59567595MaRDI QIDQ652537
Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
Publication date: 14 December 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-010-9421-1
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
05C85: Graph algorithms (graph-theoretic aspects)