scientific article; zbMATH DE number 7764121

DOI10.4230/lipics.ipec.2020.30MaRDI QIDQ6089678

Tuukka Korhonen

Publication date: 13 November 2023

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

zbMATH Keywords

minimal separatorsSMStreedepthPACE 2020

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

On the hardness of inclusion-wise minimal separators enumeration ⋮ The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

Cites Work

• Treewidth computations. II. Lower bounds
• Optimal node ranking of tree in linear time
• On the vertex ranking problem for trapezoid, circular-arc and other graphs
• Treedepth Parameterized by Vertex Cover Number.
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• A wide-range algorithm for minimal triangulation from an arbitrary ordering
• Chordal graphs and their clique graphs

This page was built for publication: