License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2021.27
URN: urn:nbn:de:0030-drops-154109
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15410/
Bläsius, Thomas ;
Fischbeck, Philipp ;
Gottesbüren, Lars ;
Hamann, Michael ;
Heuer, Tobias ;
Spinner, Jonas ;
Weyand, Christopher ;
Wilhelm, Marcus
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm
Abstract
The cluster editing problem is to transform an input graph into a cluster graph by performing a minimum number of edge editing operations. A cluster graph is a graph where each connected component is a clique. An edit operation can be either adding a new edge or removing an existing edge. In this write-up we outline the core techniques used in the exact cluster editing algorithm of the KaPoCE framework (contains also a heuristic solver), submitted to the exact track of the 2021 PACE challenge.
BibTeX - Entry
@InProceedings{blasius_et_al:LIPIcs.IPEC.2021.27,
author = {Bl\"{a}sius, Thomas and Fischbeck, Philipp and Gottesb\"{u}ren, Lars and Hamann, Michael and Heuer, Tobias and Spinner, Jonas and Weyand, Christopher and Wilhelm, Marcus},
title = {{PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm}},
booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)},
pages = {27:1--27:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-216-7},
ISSN = {1868-8969},
year = {2021},
volume = {214},
editor = {Golovach, Petr A. and Zehavi, Meirav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15410},
URN = {urn:nbn:de:0030-drops-154109},
doi = {10.4230/LIPIcs.IPEC.2021.27},
annote = {Keywords: cluster editing}
}
