The University of Southampton
University of Southampton Institutional Repository

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
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
We give a simple O(n3/2log 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(n3/2log n) time and O(n3/2log n) time, respectively.
0167-6377
625-628
Lechford, Adam N.
c42f13e7-f845-44a1-91be-d5c00ab6b8cd
Pearson, Nicholas A.
891c15b6-6ec9-4061-ae8a-2c5d469d1af7
Lechford, Adam N.
c42f13e7-f845-44a1-91be-d5c00ab6b8cd
Pearson, Nicholas A.
891c15b6-6ec9-4061-ae8a-2c5d469d1af7

Lechford, Adam N. and Pearson, Nicholas A. (2005) A fast algorithm for minimum weight odd circuits and cuts in planar graphs. Operations Research Letters, 33 (6), 625-628. (doi:10.1016/j.orl.2004.12.001).

Record type: Article

Abstract

We give a simple O(n3/2log 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(n3/2log n) time and O(n3/2log n) time, respectively.

This record has no associated files available for download.

More information

Published date: November 2005
Organisations: Operational Research

Identifiers

Local EPrints ID: 50723
URI: http://eprints.soton.ac.uk/id/eprint/50723
ISSN: 0167-6377
PURE UUID: b428f626-bcf2-4dfb-a850-a07fc2caed36

Catalogue record

Date deposited: 27 Mar 2008
Last modified: 15 Mar 2024 10:11

Export record

Altmetrics

Contributors

Author: Adam N. Lechford
Author: Nicholas A. Pearson

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×