WATANABE Toshimasa | Graduate School of Engineering, Hiroshima University
スポンサーリンク
概要
関連著者
-
WATANABE Toshimasa
Graduate School of Engineering, Hiroshima University
-
Taoka Satoshi
Graduate School Of Engineering Hiroshima University
-
Watanabe Toshimasa
Graduate School Of Engineering Hiroshima Univ.
-
TAOKA Satoshi
Graduate School of Engineering, Hiroshima University
-
Watanabe Toshimasa
Graduate School Of Engineering Hiroshima University
-
Taoka Satoshi
Hiroshima Univ. Higashihiroshima‐shi Jpn
-
Watanabe Toshimasa
Hiroshima Univ. Higashi‐hiroshima Jpn
-
Takafuji Daisuke
Graduate School Of Engineering Hiroshima University
-
TAKAFUJI Daisuke
Graduate School of Engineering, Hiroshima University
-
Yamauchi M
Pharmaceutical Research Institute Kyowa Hakko Kogyo Co. Ltd.
-
Yamauchi M
School Of Engineering Kinki University
-
Taoka S
Hiroshima Univ. Higashi‐hiroshima Jpn
-
Tamura M
Graduate School Of Engineering Hiroshima University
-
TAMURA Makoto
Graduate School of Engineering, Hiroshima University
-
YAMAUCHI Masahiro
School of Engineering, Kinki University
-
Tamura Makoto
Graduate School Of Engineering Hiroshima University
-
Watanabe T
Hiroshima Univ. Higashi‐hiroshima Jpn
-
Watanabe T
Hiroshima Univ.
-
OCHIIWA Satoru
Graduate School of Engineering, Hiroshima University
-
NISHIKAWA Yasunori
Graduate School of Engineering, Hiroshima University
-
IGUCHI Takashi
Graduate School of Engineering, Hiroshima University
-
Ochiiwa Satoru
Graduate School Of Engineering Hiroshima University
-
Iguchi Takashi
Graduate School Of Engineering Hiroshima University
-
Nishikawa Yasunori
Graduate School Of Engineering Hiroshima University
著作論文
- Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs(Concurrent Systems,Concurrent/Hybrid Systems: Theory and Applications)
- A 2-Approximation Algorithm 2-ABIS for 2-Vertex-Connectivity Augmentation of Specified Vertices in a Graph
- A (2 - 2/|L|)-Approximation Algorithm R2VS or R2ES to 2-Vertex- or 2-Edge-Connect Specified Vertices in a Graph
- Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets
- Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets
- Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets(Concurrent/Hybrid Systems : Theory and Applications)
- Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem
- Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs
- Performance Comparison of Algorithms for the Dynamic Shortest Path Problem(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
- The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms
- Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs