A fast algorithm for minimum weight odd circuits and cuts in planar graphs |
| |
| Authors: | Adam N. Letchford Nicholas A. Pearson |
| |
| Affiliation: | Department of Management Science, The Management School, Lancaster University, Lancaster LA1 4YX, UK |
| |
| Abstract: | We give a simple  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  time and  time, respectively. |
| |
| Keywords: | Planar graphs Algorithms Combinatorial optimization |
| 本文献已被 ScienceDirect 等数据库收录！ |
