Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Korhonen, Tuukka https://www.dagstuhl.de/lipics License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-133338
URL:

PACE Solver Description: SMS

pdf-format:


Abstract

We describe SMS, our submission to the exact treedepth track of PACE 2020. SMS computes the treedepth of a graph by branching on the Small Minimal Separators of the graph.

BibTeX - Entry

@InProceedings{korhonen:LIPIcs:2020:13333,
  author =	{Tuukka Korhonen},
  title =	{{PACE Solver Description: SMS}},
  booktitle =	{15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
  pages =	{30:1--30: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/13333},
  URN =		{urn:nbn:de:0030-drops-133338},
  doi =		{10.4230/LIPIcs.IPEC.2020.30},
  annote =	{Keywords: Treedepth, PACE 2020, SMS, Minimal separators}
}

Keywords: Treedepth, PACE 2020, SMS, Minimal separators
Seminar: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Issue date: 2020
Date of publication: 04.12.2020
Supplementary Material: The source code of SMS is available in [Tuukka Korhonen, 2020] and in https://github.com/Laakeri/pace2020-treedepth-exact.


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