Home > Research > Publications & Outputs > A fast algorithm for minimum weight odd cuts an...
View graph of relations

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

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>2005
<mark>Journal</mark>Operations Research Letters
Issue number6
Number of pages4
Pages (from-to)625-628
Publication StatusPublished
<mark>Original language</mark>English


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.