Constant factor approximation of vertex-cuts in planar graphs

Eyal Amir, Robert Krauthgamer, Satish Rao. Constant factor approximation of vertex-cuts in planar graphs. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 90-99, ACM, 2003. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.