An edge-splitting algorithm in planar graphs

DOI10.1023/A:1024470929537zbMath1056.68109OpenAlexW1724540513MaRDI QIDQ1402535

Hiroshi Nagamochi, Peter Eades

Publication date: 28 August 2003

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024470929537

zbMATH Keywords

multigraphminimum cutplanar graphedge-connectivityundirected graphouterplanar graphedge splitting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Augmenting the edge connectivity of planar straight line graphs to three ⋮ Connectivity augmentation in planar straight line graphs

This page was built for publication: An edge-splitting algorithm in planar graphs