Abstract:The multicut problem is an NP-hard combinatorial optimization problem with diverse applications in fields such as bioinformatics, data mining and computer vision. Graph neural networks have been defined for the multicut problem but can be adapted further to its specific objective function and constraints. In this article, we introduce such an adapted graph neural network architecture in which features are assigned only to edges, and the computation of messages is based on triangles in the underlying graph. Experiments with synthetic and real-world instances with up to 200 nodes show that our method outperforms state-of-the-art heuristic solvers in terms of solution quality while maintaining feasible runtimes. For some instances, our method finds optimal solutions in seconds whereas exact solvers need hours to find and certify optimal solutions.
| Comments: | 21 pages, 5 figures |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.13673 [cs.LG] |
| (or arXiv:2605.13673v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.13673 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Lucas Fabian Naumann [view email]
[v1]
Wed, 13 May 2026 15:33:13 UTC (1,449 KB)