SMS in PACE 2020

Tuukka Korhonen

doi:10.4230/LIPIcs.IPEC.2020.30

SMS in PACE 2020

Data Structures and Algorithms 2022-02-08 v1

Authors: Tuukka Korhonen

View on arXiv ↗ PDF ↗ DOI ↗

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.

Cite

@article{arxiv.2006.07302,
  title  = {SMS in PACE 2020},
  author = {Tuukka Korhonen},
  journal= {arXiv preprint arXiv:2006.07302},
  year   = {2022}
}

Comments

3 pages, 3 appendix pages, 0 figures. Submitted as a solver description of a solver in Parameterized Algorithms and Computational Experiments Challenge 2020

SMS in PACE 2020

Abstract

Cite

Comments

Related papers