Constant factor approximation of vertex-cuts in planar graphs
From MaRDI portal
Publication:3581244
DOI10.1145/780542.780557zbMath1192.68867MaRDI 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
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Approximating small balanced vertex separators in almost linear time, Approximation algorithms for treewidth, Solution methods for the vertex variant of the network system vulnerability analysis problem