scientific article; zbMATH DE number 7764125

DOI10.4230/LIPICS.IPEC.2020.34arXiv2006.09912MaRDI QIDQ6089683FDOQ6089683

Authors: James Trimble 

Publication date: 13 November 2023

Full work available at URL: https://arxiv.org/abs/2006.09912

Title of this publication is not available (Why is that?)

zbMATH Keywords

graph algorithmselimination treetreedepth

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