Andrea Horňáková

Analysis and Optimization of Graph Decompositions by Lifted Multicuts

We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of classes of decompositions by must-join and must-cut constraints and related to the comparison of clus…