scientific article; zbMATH DE number 1775386

zbMath1028.68219MaRDI QIDQ4542518

Roded Sharan, Ron Shamir, Assaf Natanzon

Publication date: 1 August 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bounded degree graphsminimum fill-in problem

Mathematics Subject Classification ID

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

Related Items (8)

Characterizing and Computing Minimal Cograph Completions ⋮ Unnamed Item ⋮ Recognizing Sparse Perfect Elimination Bipartite Graphs ⋮ Minus domination in small-degree graphs ⋮ Characterizing and computing minimal cograph completions ⋮ Subexponential parameterized algorithms and kernelization on almost chordal graphs ⋮ Parameterized Complexity ⋮ Unnamed Item

This page was built for publication: