scientific article; zbMATH DE number 7764122

DOI10.4230/LIPICS.IPEC.2020.31MaRDI QIDQ6089680zbMATH OpenFDO

Authors Zijian Xu, Vorapong Suppakitpaisarn

Publication date 13 November 2023

zbMATH Keywords

minimal separatorsexperimental algorithmtreedepth

Mathematics Subject Classification ID

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

Cited in

(2)

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

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