Maximum Cut Algorithms and Upper Bounds for Planar and Toroidal Graphs

Abstract

We demonstrate that the problem of finding the maximum cut of a planar graph with arbitrary weights can be easily mapped to a minimum T-join problem in the absolute dual graph - the dual graph with absolute weights, as opposed to the known mapping to a maximum T-join problem with an empty set in the dual graph. By enabling the use of the shortest paths, this approach allows for the straightforward adaptation of the first efficient Max-Cut algorithm, designed by Hadlock in 1975 for planar graphs with non-negative weights, to handle the general case of planar graphs with arbitrary weights. Furthermore, we prove that applying a planar Max-Cut algorithm to a higher genus graph, such as a toroidal graph, while disregarding its topology, provides an upper bound for its maximum cut. Employing this methodology, we derive upper bounds for the maximum cut across all toroidal graphs within the GSet benchmark. We report that the known maximum cut values for part of those GSet toroidal problems including the three largest instances, which were previously documented in the literature, are the maximum possible because they match their upper bound values. Additionally, we introduce a novel heuristic algorithm for finding Max-Cut of toroidal graphs, which is based on the planar graph algorithm. Applying this algorithm to all seventeen toroidal Max-Cut problems in the GSet benchmark successfully reproduces all the best-known results, and for problem #62, it yields a new, previously unknown best Max-Cut value.