We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

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

« Back

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

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>2005
<mark>Journal</mark>Operations Research Letters
Number of pages4
<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.

Related projects