A fast algorithm for minimum weight odd circuits and cuts in planar graphs

We give a simple O(n3/2logn) algorithm for finding a minimum weight odd circuit in planar graphs. By geometric duality, the same algorithm can be used to find minimum weight odd cuts. For general sparse graphs, the fastest known algorithms for these two problems take O(n2logn) time and O(n3logn) time, respectively.