Go to AAAI 2018 homepageExact Clustering via Integer Programming and Maximum Satisfiability
Abstract: We consider the following general graph clustering problem: given a complete undirected graph G
0 Replies
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview