Nagamochi H | Kyoto Univ.
スポンサーリンク
概要
関連著者
-
Nagamochi H
Kyoto Univ.
-
Ibaraki Toshihide
School of Science and Technology, Kwansei Gakuin University
-
Ibaraki T
School Of Science And Technology Kwansei Gakuin University
-
Ibaraki Toshihide
Department Of Informatics Kwansei Gakuin University
-
NAGAMOCHI Hiroshi
Department of Applied Mathematics and Physics, Kyoto University
-
Nagamochi Hiroshi
Kyoto Univ. Kyoto‐shi Jpn
-
Nagamochi Hiroshi
Kyoto Univ.
-
ISHII Toshimasa
Kyoto University
-
IBARAKI Toshihide
Kyoto University
-
Nagamochi Hiroshi
Department Of Applied Mathematics And Physics Graduate School Of Engineering Kyoto University
-
IBARAKI Toshihide
Kyoto College of Graduate Studies for Informatics
-
Kameda Tiko
School of Computing Science Simon Fraser University
-
Kameda Tiko
School Of Computing Science Faculty Of Applied Sciences Simon Fraser University
-
Ibaraki Toshihide
Department of Informatics, Kwansei Gakuin University
-
ISHII Toshimasa
Department of Gastroenterological Surgery, Saitama International Medical Center, Saitama Medical Uni
-
Nagamochi Hiroshi
Department Of Applied Mathematics And Physics Graduate School Of Informatics Kyoto University
-
Ishii Toshimasa
Department Of Gastroenterological Surgery Saitama International Medical Center Saitama Medical Unive
-
Ibaraki Toshihide
Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University
著作論文
- CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
- Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements
- Optimal augmentation of a 2-vertex-connected multigraph to a k-edge-connected and 3-vertex-connected multigraph
- A Simple Proof of a Minimum Cut Algorithm and Its Applications
- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
- Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously