Mashima Toshiya | Department Of Computer Engineering Faculty Of Information Sciences Hiroshima City University
スポンサーリンク
概要
- MASHIMA Toshiyaの詳細を見る
- 同名の論文著者
- Department Of Computer Engineering Faculty Of Information Sciences Hiroshima City Universityの論文著者
関連著者
-
Mashima Toshiya
Department Of Computer Engineering Faculty Of Information Sciences Hiroshima City University
-
Taoka Satoshi
Graduate School Of Engineering Hiroshima University
-
Taoka Satoshi
Hiroshima Univ. Higashihiroshima‐shi Jpn
-
Watanabe Toshimasa
Hiroshima Univ. Higashi‐hiroshima Jpn
-
MASHIMA Toshiya
Department of Computer Engineering, Faculty of Information Sciences, Hiroshima City University
-
Watanabe Toshimasa
Graduate School Of Engineering Hiroshima Univ.
-
Mashima Toshiya
Department Of Information And Communications Technology Faculty Of Engineering Hiroshima International University
-
Watanabe Toshimasa
Graduate School Of Engineering Hiroshima University
-
Oki Tadachika
Graduate School Of Engineering Hiroshima University
-
Watanabe Toshimasa
Department Of Circuits And Systems Faculty Of Engineering Hiroshima University
-
FUKUOKA Takanori
Graduate School of Engineering, Hiroshima University
-
Fukuoka Takanori
The Graduate School Of Engineering Hiroshima University
著作論文
- Graph Augmentation Problems with Degree-Unchangeable Vertices(Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
- On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree(Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
- A 2-Approximation Algorithm to (k+1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph(Discrete Mathematics and Its Applications)
- A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
- A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints