scientific article; zbMATH DE number 7764121

DOI10.4230/LIPICS.IPEC.2020.30MaRDI QIDQ6089678zbMATH OpenFDO

Authors Tuukka Korhonen

Publication date 13 November 2023

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2020.30

zbMATH Keywords

minimal separatorsPACE 2020SMStreedepth

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(3)

• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
• On the hardness of inclusion-wise minimal separators enumeration
• On the size of minimal separators for treedepth decomposition

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 Q6089678)