z-logo
open-access-imgOpen Access
Constant factor approximation of vertex-cuts in planar graphs
Author(s) -
Eyal Amir,
Robert Krauthgamer,
Satish Rao
Publication year - 2003
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/780555.780557
Subject(s) - quotient , vertex (graph theory) , combinatorics , mathematics , bounded function , approximation algorithm , planar graph , planar , constant (computer programming) , binary logarithm , feedback vertex set , discrete mathematics , graph , mathematical analysis , computer science , computer graphics (images) , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom