Tadachika OKI

Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One
Satoshi TAOKA Tadachika OKI Toshiya MASHIMA Toshimasa WATANABE 
Publication Date: 2018/02/01
Vol. E101-A  No. 2  pp. 357-366
Type of Manuscript:  Special Section PAPER (Special Section on Mathematical Systems Science and its Applications)
connectivity augmentation problemsedge-connectivitymultipartition constraintsgraphspolynomial time algorithms
 Summary | Full Text:PDF(770.3KB)

A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints
Tadachika OKI Satoshi TAOKA Toshiya MASHIMA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2012/03/01
Vol. E95-D  No. 3  pp. 769-777
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science – Mathematical Foundations and Applications of Computer Science and Algorithms –)
connectivity augmentation problemsedge-connectivitybipartition constraintsgraphspolynomial time algorithms
 Summary | Full Text:PDF(341KB)