Augmenting the Connectivity of Outerplanar Graphs
- 90 Downloads
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.
KeywordsGraph augmentation Outerplanar graph
- 6.Hsu, T.S.: On four-connecting a triconnected graph. In: Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 70–79 (1992) Google Scholar
- 8.Kant, G.: Algorithms for drawing planar graphs. Ph.D. thesis, Dept. of Computer Science, Utrecht University (1993) Google Scholar