Bläsius, Thomas
[Author];
Gottesbüren, Lars
[Author];
Heuer, Tobias
[Author];
Weyand, Christopher
[Author];
Fischbeck, Philipp
[Author];
Hamann, Michael
[Author];
Spinner, Jonas
[Author];
Wilhelm, Marcus
[Author]
PACE solver description: KaPoCE: A heuristic cluster editing algorithm
You can manage bookmarks using lists, please log in to your user account for this.
Media type:
Text;
E-Article;
Electronic Conference Proceeding
Title:
PACE solver description: KaPoCE: A heuristic cluster editing algorithm
Contributor:
Bläsius, Thomas
[Author];
Gottesbüren, Lars
[Author];
Heuer, Tobias
[Author];
Weyand, Christopher
[Author];
Fischbeck, Philipp
[Author];
Hamann, Michael
[Author];
Spinner, Jonas
[Author];
Wilhelm, Marcus
[Author]
imprint:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 2021-12-23
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
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 heuristic cluster editing algorithm of the Karlsruhe and Potsdam Cluster Editing (KaPoCE) framework, submitted to the heuristic track of the 2021 PACE challenge.