scientific article; zbMATH DE number 1420906

zbMath0943.05077MaRDI QIDQ4944975

Konstantin Skodinis

Publication date: 7 June 2000

Full work available at URL: https://eudml.org/doc/120594

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

zbMATH Keywords

algorithmtree-decompositionminimal separators

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ Finding a maximum minimal separator: graph classes and fixed-parameter tractability ⋮ Fair allocation algorithms for indivisible items under structured conflict constraints ⋮ Treewidth versus clique number. II: Tree-independence number ⋮ On the Maximum Weight Minimal Separator ⋮ Algorithms parameterized by vertex cover and modular width, through potential maximal cliques ⋮ On the maximum weight minimal separator ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure