Planar Biconnectivity Augmentation with Fixed Embedding

  • Carsten Gutwenger
  • Petra Mutzel
  • Bernd Zey
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5874)


A combinatorial embedding\({\it \Pi}\) of a planar graph G = (V,E) is defined by the cyclic order of incident edges around each vertex in a planar drawing of G. The planar biconnectivity augmentation problem with fixed embedding (PBA-Fix) asks for a minimum edge set E′ ⊆ V×V that augments \({\it \Pi}\) to a combinatorial embedding \({\it \Pi}'\) of G + E′ such that G + E′ is biconnected and \({\it \Pi}\) is preserved, i.e., \({\it \Pi}'\) restricted to G yields again \({\it \Pi}\).

In this paper, we show that PBA-Fix is NP-hard in general, i.e., for not necessarily connected graphs, by giving a reduction from 3-PARTITION. For connected graphs, we present an \(\mathcal{O}(|V|(1+\alpha(|V|)))\) time algorithm solving PBA-Fix optimally. Moreover, we show that—considering each face of \({\it \Pi}\) separately—this algorithm meets the lower bound for the general biconnectivity augmentation problem proven by Eswaran and Tarjan [1].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Eswaran, K., Tarjan, R.: Augmentation problems. SIAM Journal on Computing 5(4), 653–665 (1976)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Fialko, S., Mutzel, P.: A new approximation algorithm for the planar augmentation problem. In: Proc. SODA 1998, pp. 260–269. SIAM, Philadelphia (1998)Google Scholar
  3. 3.
    Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing 4(4), 397–411 (1975)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Gutwenger, C., Mutzel, P.: Planar polyline drawings with good angular resolution. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 167–182. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  5. 5.
    Gutwenger, C., Mutzel, P., Zey, B.: On the hardness and approximability of planar biconnectivity augmentation. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 249–257. Springer, Heidelberg (2009)Google Scholar
  6. 6.
    Hsu, T.-S., Ramachandran, V.: On finding a smallest augmentation to biconnect a graph. SIAM Journal on Computing 22(5), 889–912 (1993)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Kant, G., Bodlaender, H.L.: Planar graph augmentation problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 286–298. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  8. 8.
    OGDF: An Open Graph Drawing Framework (2009),
  9. 9.
    Rosenthal, A., Goldner, A.: Smallest augmentations to biconnect a graph. SIAM Journal on Computing 6(1), 55–66 (1977)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146–160 (1972)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Westbrook, J., Tarjan, R.: Maintaining bridge-connected and biconnected components on-line. Algorithmica 7(5&6), 433–464 (1992)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Zey, B.: Algorithms for planar graph augmentation. Master’s thesis, Dortmund University of Technology (2008),

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Carsten Gutwenger
    • 1
  • Petra Mutzel
    • 1
  • Bernd Zey
    • 1
  1. 1.Department of Computer ScienceTechnische Universität DortmundGermany

Personalised recommendations