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.Official URL: http://dx.doi.org/10.1016/j.orl.2004.12.001
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: | Article |
|---|---|
| Journal or Publication Title: | Operations Research Letters |
| Uncontrolled Keywords: | Planar graphs ; Combinatorial optimisation |
| Subjects: | H Social Sciences > HB Economic Theory |
| Departments: | Lancaster University Management School > Management Science |
| ID Code: | 43969 |
| Deposited By: | ep_importer_pure |
| Deposited On: | 11 Jul 2011 19:07 |
| Refereed?: | Yes |
| Published?: | Published |
| Last Modified: | 26 Jul 2012 18:55 |
| Identification Number: | |
| URI: | http://eprints.lancs.ac.uk/id/eprint/43969 |
Actions (login required)
| View Item |
