In this contribution, we present the multiplets algorithm for constructing and selecting optimal sets of disjoint hyperedges across multiple groups in tabular data. We describe its main computational steps and provide a complexity analysis covering both the edge construction and optimization phases, based on the Linear Sum Assignment method and the Constraint Programming SAT-based solver.
Daňková et al. (Thu,) studied this question.