Augmenting the Connectivity of Outerplanar Graphs

We provide an optimal algorithm for the problem of augmenting an outerplanar graph G by adding a minimum number of edges in such a way that the augmented graph G′ is outerplanar and 2-connected. We also solve optimally the same problem when instead we require G′ to be 2-edge-connected.

[1]  Akira Nakamura,et al.  A smallest augmentation to 3-connect a graph , 1990, Discret. Appl. Math..

[2]  Akira Nakamura,et al.  Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..

[3]  T. Hsu,et al.  On four-connecting a triconnected graph , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[4]  Eddie Cheng,et al.  Successive edge-connectivity augmentation problems , 1999, Math. Program..

[5]  Toshihide Ibaraki,et al.  Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs , 1996, STOC '96.

[6]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[7]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[8]  Marc Noy,et al.  Packing trees into planar graphs , 2002, J. Graph Theory.

[9]  G. Kant.  Algorithms for drawing planar graphs , 1993 .

[10]  Goos Kant,et al.  Augmenting Outerplanar Graphs , 1996, J. Algorithms.

[11]  Bill Jackson,et al.  Independence free graphs and vertex connectivity augmentation , 2001, J. Comb. Theory, Ser. B.