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

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

0.00 Avg rating—0 Votes
Article ID: iaor2006943
Country: Netherlands
Volume: 33
Issue: 6
Start Page Number: 625
End Page Number: 628
Publication Date: Nov 2005
Journal: Operations Research Letters
Authors: ,
Keywords: networks
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.

Reviews

Required fields are marked *. Your email address will not be published.