Unifying Maximum Cut and Minimum Cut of a Planar Graph

The real-weight maximum cut of a planar graph is considered. Given an undirected planar graph with real-value weights associated with its edges, the problem is to find a partition of the vertices into two nonempty sets such that the sum of the weights of the edges connecting the two sets is maximum. The conventional maximum cut and minimum cut problems assume nonnegative edge weights, and thus are special cases of the real-weight maximum cut. An O(n/sup 3/2/ log n) algorithm for finding a real-weight maximum cut of a planar graph where n is the number of vertices in the graph is developed. The best maximum cut algorithm previously known for planar graphs has running time of O(n/sup 3/). >

[1]  S. Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, FOCS 1982.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  John H. Reif,et al.  Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time , 1981, ICALP.

[4]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[5]  Ulrich Derigs,et al.  An analysis of alternative strategies for implementing matching algorithms , 1983, Networks.

[6]  Masao Iri,et al.  Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time" , 1977, SIAM J. Comput..

[7]  Yossi Shiloach.  A Multi-Terminal Minimum Cut Algorithm for Planar Graphs , 1980, SIAM J. Comput..

[8]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  John H. Reif,et al.  Minimum s-t Cut of a Planar Undirected Network in O(n log2(n)) Time , 1983, SIAM J. Comput..

[10]  Siam J. CoMPtrr,et al.  FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .

[11]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

[12]  Alon Itai,et al.  Maximum Flow in Planar Networks , 1979, SIAM J. Comput..

[13]  W. T. Tutte.  A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.

[14]  Harold Neil Gabow,et al.  Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .

[15]  Silvio Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[16]  Nobuji Saito,et al.  Planar Multicommodity Flows, Maximum Matchings and Negative Cycles , 1986, SIAM J. Comput..