Keyword : connectivity augmentation


Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph
Satoshi TAOKA Toshimasa WATANABE 
Publication:   
Publication Date: 2019/02/01
Vol. E102-A  No. 2 ; pp. 379-388
Type of Manuscript:  Special Section PAPER (Special Section on Mathematical Systems Science and its Applications)
Category: 
Keyword: 
graphsconnectivity augmentationedge-connectivityedge-interchange operationspolynomial time algorithms
 Summary | Full Text:PDF(670.3KB)

A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs
Hiroshi NAGAMOCHI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/05/01
Vol. E89-A  No. 5 ; pp. 1263-1268
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
algorithmconnectivity augmentationedge-connectivityedge-splittingextreme vertex setsgraph
 Summary | Full Text:PDF(166.6KB)

A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase
Takanori FUKUOKA Toshiya MASHIMA Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/04/01
Vol. E88-A  No. 4 ; pp. 954-963
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
graphsconnectivity augmentationvertex-connectivitydegree constraintslinear time algorithms
 Summary | Full Text:PDF(301.7KB)

Graph Augmentation Problems with Degree-Unchangeable Vertices
Toshiya MASHIMA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/03/01
Vol. E84-A  No. 3 ; pp. 781-793
Type of Manuscript:  Special Section PAPER (Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
graphconnectivity augmentationvertex-connectivitydegree-unchangeable verticespolynomial time algorithms
 Summary | Full Text:PDF(648.3KB)

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)