Planar multicommodity flows, maximum matchings and negative cycles
SIAM Journal on Computing
Graph Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Partitioning planar graphs: a fast combinatorial approach for max-cut
Computational Optimization and Applications
Optimal layout decomposition for double patterning technology
Proceedings of the International Conference on Computer-Aided Design
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Discrete Optimization
An algorithm for min-cost edge-disjoint cycles and its applications
Operations Research Letters
| Hi-index | 14.98 |
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/).