Article ID Journal Published Year Pages File Type
10523996 Operations Research Letters 2005 4 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Authors
, ,