Faster Parameterized Algorithms for Minimum Fill-In

DOI10.1007/978-3-540-92182-0_27zbMath1183.05075WikidataQ59567734 ScholiaQ59567734MaRDI QIDQ3596726

Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_27

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)