scientific article; zbMATH DE number 7764120

DOI10.4230/LIPICS.IPEC.2020.29MaRDI QIDQ6089677FDOQ6089677

Authors: Ruben Brokkelkamp, Raymond van Venetië, Mees J. de Vries, Jan Westerdiep 

Publication date: 13 November 2023

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

zbMATH Keywords

branch and boundvertex rankingminimal separatorstreedepthtreedepth decompositionPACE 2020

Mathematics Subject Classification ID

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

Cites Work

• Optimal node ranking of trees
• Title not available (Why is that?)

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