License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2020.32
URN: urn:nbn:de:0030-drops-133350
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13335/
Go to the corresponding LIPIcs Volume Portal

Strasser, Ben

PACE Solver Description: Tree Depth with FlowCutter

pdf-format:
LIPIcs-IPEC-2020-32.pdf (0.3 MB)

Abstract

We describe the FlowCutter submission to the PACE 2020 heuristic tree-depth challenge. The task of the challenge consists of computing an elimination tree of small height for a given graph. At its core our submission uses a nested dissection approach, with FlowCutter as graph bisection algorithm.

BibTeX - Entry

@InProceedings{strasser:LIPIcs:2020:13335,
  author =	{Ben Strasser},
  title =	{{PACE Solver Description: Tree Depth with FlowCutter}},
  booktitle =	{15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
  pages =	{32:1--32:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-172-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{180},
  editor =	{Yixin Cao and Marcin Pilipczuk},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13335},
  URN =		{urn:nbn:de:0030-drops-133350},
  doi =		{10.4230/LIPIcs.IPEC.2020.32},
  annote =	{Keywords: tree depth, graph algorithm, partitioning}
}

Keywords: tree depth, graph algorithm, partitioning
Collection: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Issue Date: 2020
Date of publication: 04.12.2020
Supplementary Material: Our source code is available at https://github.com/ben-strasser/flow-cutter-pace20 and https://doi.org/10.5281/zenodo.3870928.

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI