2026-07-22T06:25:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13339 2024-03-06T10:51:44Z ddc:004 open_access

PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions Wrochna, Marcin treedepth decomposition heuristic weak colouring numbers We describe a heuristic algorithm for computing treedepth decompositions, submitted for the https://pacechallenge.org/2020 challenge. It relies on a variety of greedy algorithms computing elimination orderings, as well as a Divide & Conquer approach on balanced cuts obtained using a from-scratch reimplementation of the 2016 FlowCutter algorithm by Hamann & Strasser [Michael Hamann and Ben Strasser, 2018]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Marcin Wrochna 2020 Is Part Of LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2020.36 urn:nbn:de:0030-drops-133391 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.36 eng https://creativecommons.org/licenses/by/3.0/legalcode