Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time”

DOI10.1137/0206007zbMath0348.05003OpenAlexW1965921519MaRDI QIDQ4117837

K. Aoshima, Masao Iri

Publication date: 1977

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0206007

Mathematics Subject Classification ID

Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (3)

Partitioning planar graphs: a fast combinatorial approach for max-cut ⋮ The line index and minimum cut of weighted graphs ⋮ Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions

This page was built for publication: Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time”