Mitsuhiro YAMAKADO


A Linear Time Algorithm for Smallest Augmentation to 3-Edge-Connect a Graph
Toshimasa WATANABE Mitsuhiro YAMAKADO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/04/25
Vol. E76-A  No. 4  pp. 518-531
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
linear-time algorithms3-edge-connected graphsconnectivity augmentationcomputational complexity
 Summary | Full Text:PDF(1.1MB)