Faster Parameterized Algorithms for Minimum Fill-In

DOI10.1007/978-3-540-92182-0_27MaRDI QIDQ3596726zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Pinar Heggernes, Yngve Villanger, 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

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

Recommendations

• Faster parameterized algorithms for \textsc{Minimum Fill-in}
• scientific article; zbMATH DE number 7053390
• Subexponential parameterized algorithm for minimum fill-in
• Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
• scientific article; zbMATH DE number 1775386

Cited in

(12)

• Subexponential parameterized algorithm for minimum fill-in
• Fast Computation of Minimal Fill Inside A Given Elimination Ordering
• Searching for better fill-in
• scientific article; zbMATH DE number 7053390 (Why is no real title available?)
• The necessary and sufficient condition and the efficient algorithms for gradually varied fill
• A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
• Faster parameterized algorithms for minor containment
• Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
• Faster parameterized algorithms for \textsc{Minimum Fill-in}
• scientific article; zbMATH DE number 1775386 (Why is no real title available?)
• A parameterized algorithm for chordal sandwich
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596726)