Mashima Toshiya | Department Of Information And Communications Technology Faculty Of Engineering Hiroshima International University
スポンサーリンク
概要
- MASHIMA Toshiyaの詳細を見る
- 同名の論文著者
- Department Of Information And Communications Technology Faculty Of Engineering Hiroshima International Universityの論文著者
関連著者
-
Taoka Satoshi
Hiroshima Univ. Higashihiroshima‐shi Jpn
-
Mashima Toshiya
Department Of Information And Communications Technology Faculty Of Engineering Hiroshima International University
-
Watanabe Toshimasa
Hiroshima Univ. Higashi‐hiroshima Jpn
-
Taoka Satoshi
Graduate School Of Engineering Hiroshima University
-
Mashima Toshiya
Department Of Computer Engineering Faculty Of Information Sciences Hiroshima City University
-
Watanabe Toshimasa
Graduate School Of Engineering Hiroshima Univ.
-
Watanabe Toshimasa
Graduate School Of Engineering Hiroshima University
-
MASHIMA Toshiya
Department of Computer Engineering, Faculty of Information Sciences, Hiroshima City University
-
Fukuoka Takanori
The Graduate School Of Engineering Hiroshima University
-
Oki Tadachika
Graduate School Of Engineering Hiroshima University
-
TAOKA Satoshi
the Graduate School of Engineering, Hiroshima University
-
WATANABE Toshimasa
the Graduate School of Engineering, Hiroshima University
-
MASHIMA Toshiya
the Department of Information Technology, Faculty of Infrastructural Technologies, Hiroshima Interna
-
FUKUOKA Takanori
the Graduate School of Engineering, Hiroshima University
-
FUKUOKA Takanori
Graduate School of Engineering, Hiroshima University
著作論文
- A linear time algorithm for tri-connectivity augmentation of bi-connected graphs with upper bounds on vertex-degree increase (第21回 回路とシステム軽井沢ワークショップ論文集) -- (グラフアルゴリズム)
- 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)
- Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase(Graph Algorithm, Foundations of Computer Science)
- 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)
- Tri-connectivity augmentation problems for bi-connected graphs with upper bounds on vertex-degree increase (ネツトワークの信頼性)
- A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints