Faster Parameterized Algorithms for Minimum Fill-In

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

Yngve Villanger, Pinar Heggernes, Hans L. Bodlaender

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

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs

This page was built for publication: Faster Parameterized Algorithms for Minimum Fill-In