A Linear Time Algorithm for Triconnectivity Augmentation

Tsan-sheng Hsu AND Vijaya Ramachandran Proc. 32th Annual IEEE Conf. on Foundations of Computer Science (FOCS), pages 548-559, 1991.

2003/3/06

Definitions. n-separation (H , K) : Let G be a connected graph. For any positive integer n, we define an n-spearation of G as an ordered pair (H,K) of edgedisjoint subgraphs of G satisfying the three following conditions: i) H U K = G.

ii) H and k have exactly n common vertices.

iii)* H and K have each at least n edges.

k-connected graph: We say that G is k-connected, where k is a positive integer, if it has no n-separation for any n < k.

Idea:

A-maximal 2-separation:

Case 1

Case 2

Case 3

A-maximal 2-separation & Tutte splitting & 3-block graph:

Connect two leaves in blk3(G):

Condition 1

Condition 2

Condition 3

Theorem 1. Every blk3(G) with d - 1 l/2 and more than 3 leaves always can be found out two leaves that satisfy leafconnecting condition (i), (ii) or (iii). Proof.

Two only cases that a balanced blk3(G) with 3 leaves violates the leaf-connecting condition.

A Lower Bound for the Triconnectivity Augmentation Number:

Proof. By Theorem 1, Lemma 4.4.8.