Constant factor approximation of vertex-cuts in planar graphs

DOI10.1145/780542.780557MaRDI QIDQ3581244zbMATH OpenOpenAlexFDO

Authors

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

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

Cited in

(5)

• Solution methods for the vertex variant of the network system vulnerability analysis problem
• scientific article; zbMATH DE number 7651159 (Why is no real title available?)
• Approximating small balanced vertex separators in almost linear time
• Exact and approximate hierarchical hub labeling
• Approximation algorithms for treewidth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581244)