scientific article; zbMATH DE number 1775386

MaRDI QIDQ4542518zbMATH OpenFDO

Authors Assaf Natanzon, Ron Shamir, Roded Sharan

Publication date 1 August 2002

zbMATH Keywords

bounded degree graphsminimum fill-in problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
• Subexponential parameterized algorithm for minimum fill-in
• Faster Parameterized Algorithms for Minimum Fill-In
• Faster parameterized algorithms for \textsc{Minimum Fill-in}
• Minimum fill-in of sparse graphs: kernelization and approximation

Cited in

(13)

• Subexponential parameterized algorithms and kernelization on almost chordal graphs
• Minimum fill-in: inapproximability and almost tight lower bounds
• Parameterized complexity: the main ideas and connections to practical computing
• Recognizing sparse perfect elimination bipartite graphs
• Characterizing and Computing Minimal Cograph Completions
• Faster Parameterized Algorithms for Minimum Fill-In
• Fast Computation of Minimal Fill Inside A Given Elimination Ordering
• A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
• Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
• scientific article; zbMATH DE number 7053390 (Why is no real title available?)
• scientific article; zbMATH DE number 7651188 (Why is no real title available?)
• Minus domination in small-degree graphs
• Characterizing and computing minimal cograph completions

This page was built for publication:

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