Optimal layer assignment for interconnect
Advances in VLSI and Computer Systems
An O(EV log V) algorithm for finding a maximal weighted matching in general graphs
SIAM Journal on Computing
Planar multicommodity flows, maximum matchings and negative cycles
SIAM Journal on Computing
Unifying Maximum Cut and Minimum Cut of a Planar Graph
IEEE Transactions on Computers
Graph Algorithms
| Hi-index | 0.00 |
The problems of finding minimum-cost and maximum-cost sets of edge-disjoint cycles in a weighted undirected graph are studied. The importance of this problem is that it presents a 'middle station' in two reductions for planar graphs - one between the max-cut problem and that of max-weight matching, and the other between the Chinese Postman Problem and max-weight matching. The introduction of negative edge costs makes the reductions simple and efficient. We obtain new simpler algorithms for these two problems for planar graphs (where the max-weight matching problem can be solved very efficiently). We conclude that, in the case of planar weighted graphs (with arbitrary costs), all the three problems are mutually reducible and equivalent in terms of complexity.