Two-Connected Augmentation Problems in Planar Graphs

DOI10.1006/jagm.1999.1005zbMath0942.68096OpenAlexW2032111056MaRDI QIDQ4264489

J. Scott Provan, Roger C. Burk

Publication date: 22 September 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d9fb6f3d53bdee1ccd1869420a6917c1cd534b50

zbMATH Keywords

weighted undirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators ⋮ Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ A simple algorithm for multicuts in planar graphs with outer terminals

This page was built for publication: Two-Connected Augmentation Problems in Planar Graphs