Partitioning planar graphs: a fast combinatorial approach for max-cut

F. Liers, G. Pardella. Partitioning planar graphs: a fast combinatorial approach for max-cut. Comp. Opt. and Appl., 51(1):323-344, 2012. [doi]

Abstract

Abstract is missing.