scientific article; zbMATH DE number 7764127

DOI10.4230/lipics.ipec.2020.36MaRDI QIDQ6089685

Marcin Wrochna

Publication date: 13 November 2023

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

zbMATH Keywords

decompositionheuristictreedepthweak colouring numbers

Mathematics Subject Classification ID

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

Related Items (1)

The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

Cites Work

• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Worst-case Analysis of Set Union Algorithms
• Graph Bisection with Pareto Optimization
• On the generalised colouring numbers of graphs that exclude a fixed minor

This page was built for publication: