Subexponential Parameterized Algorithm for Minimum Fill-In
From MaRDI portal
Publication:5408764
DOI10.1137/11085390XzbMath1285.68055WikidataQ56430107 ScholiaQ56430107MaRDI QIDQ5408764
Fedor V. Fomin, Yngve Villanger
Publication date: 11 April 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)