On the Hardness and Approximability of Planar Biconnectivity Augmentation.

Carsten Gutwenger Petra Mutzel Bernd Zey

Published in: COCOON (2009)

Keyphrases

approximation algorithms
phase transition
planar surfaces
planar graphs
computational complexity
np hard
worst case
np complete
data sets
single point
parallel manipulator
line drawings
learning theory
viewpoint
artificial neural networks
curved surfaces
machine learning
real world