A fast algorithm for minimum weight odd cuts and circuits in planar graphs
Adam N. Letchford, Nicholas A. Pearson · Lancaster EPrints (Lancaster University) · 2005
We give a simple O(n^{3/2} log n) 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(n^2 log n) time and O(n^3 log n) time, respectively.