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

Letchford, A N and Pearson, N (2005) A fast algorithm for minimum weight odd cuts and circuits in planar graphs. Operations Research Letters, 33 (6). pp. 625-628. ISSN 0167-6377

Full text not available from this repository.

Abstract

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.

Item Type: Journal Article
Journal or Publication Title: Operations Research Letters
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 43969
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 18:07
Refereed?: Yes
Published?: Published
Last Modified: 22 Jun 2019 03:51
URI: https://eprints.lancs.ac.uk/id/eprint/43969

Actions (login required)

View Item View Item