Constant factor approximation of vertex-cuts in planar graphs

DOI10.1145/780542.780557zbMath1192.68867OpenAlexW2047099957MaRDI QIDQ3581244

No author found.

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780557

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Approximation algorithms for treewidth ⋮ Unnamed Item ⋮ Solution methods for the vertex variant of the network system vulnerability analysis problem ⋮ Approximating small balanced vertex separators in almost linear time

This page was built for publication: Constant factor approximation of vertex-cuts in planar graphs