Subexponential Parameterized Algorithm for Minimum Fill-In

From MaRDI portal

Revision as of 02:58, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5408764

Jump to:navigation, search

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)

zbMATH Keywords

chordal graph; parameterized complexity; subexponential algorithm

Mathematics Subject Classification ID

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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5408764&oldid=20145735"