A Note on the Graph Augmentation Problem

Shuichi UENO  Katsufumi TSUJI  Yoji KAJITANI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E74-A   No.4   pp.679-680
Publication Date: 1991/04/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Issue on Discrete Mathematics and Its Applications)
Category: 
Keyword: 


Full Text: PDF>>
Buy this Article




Summary: 
For a given 2-edge-connected graph G and a spanning tree T of G, the graph augmentation problem 2ECA (T,G) is to find a minimum edge set AE (G) such that T A is 2-edge-connected. This note proves that 2ECA (T, G) is solvable in polynomial time if G is series-parallel.