A fast algorithm for minimum weight odd circuits and cuts in planar graphs
type: Item
instance of: scholarly article
title: A fast algorithm for minimum weight odd circuits and cuts in planar graphs
zbMATH Open document ID: 1080.05091
author: Adam N. Letchford
author: Nicholas A. Pearson
published in: Operations Research Letters
publication date: 2006-02-02T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65F20
zbMATH DE Number: 5003057
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: sparse graphs
MaRDI profile type: Publication
full work available at URL: j.orl.2004.12.001
OpenAlex ID: W2009614765
Wikidata QID: Q57702315
cites work: The max-cut problem on graphs not contractible to \(K_ 5\)
cites work: On the cut polytope
cites work: Set packing relaxations of some integer programs
cites work: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
cites work: Q5501344
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Q3138921
cites work: A new approach to the maximum-flow problem
cites work: Geometric algorithms and combinatorial optimization
cites work: Weakly bipartite graphs and the max-cut problem
cites work: Decomposition and optimization over cycles in binary matroids
cites work: Parallel concepts in graph theory
cites work: Faster shortest-path algorithms for planar graphs
cites work: Hamilton Paths in Grid Graphs
cites work: A Separator Theorem for Planar Graphs
cites work: Implementing an efficient minimum capacity cut algorithm
cites work: Q3714901
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
DOI: 10.1016/J.ORL.2004.12.001
description: scientific article; zbMATH DE number 5003057