Keyword : vertex-connectivity


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)

On 2-Approximation to the Vertex-Connectivity in Graphs
Hiroshi NAGAMOCHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/01/01
Vol. E88-D  No. 1 ; pp. 12-16
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science)
Category: 
Keyword: 
graph algorithmapproximation algorithmvertex-connectivityMA orderingsminimum degree
 Summary | Full Text:PDF(128.7KB)

A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph
Makoto TAMURA Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/04/01
Vol. E86-A  No. 4 ; pp. 822-828
Type of Manuscript:  Special Section PAPER (Special Section of Selected Papers from the 15th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
graphsaugmentation problemsvertex-connectivityperformance ratiospolynomial time algorithms
 Summary | Full Text:PDF(376.5KB)

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 7/3-Approximation for the Minimum Weight 3-Connected Spanning Subgraph Problem
Hiroshi NAGAMOCHI Katsuhiro SEKI Toshihide IBARAKI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/04/25
Vol. E83-A  No. 4 ; pp. 687-691
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
undirected graphvertex-connectivityapproximation algorithmspanning subgraph
 Summary | Full Text:PDF(392.2KB)

Recent Development of Graph Connectivity Augmentation Algorithms
Hiroshi NAGAMOCHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3 ; pp. 372-383
Type of Manuscript:  INVITED SURVEY PAPER
Category: Graph Algorithms
Keyword: 
edge-connectivityvertex-connectivityminimum cutsgraphsaugmentation problempolynomial algorithm
 Summary | Full Text:PDF(396.2KB)