Toshimasa ISHII


Constructing a Cactus for Minimum Cuts of a Graph in O(mn+n2log n) Time and O(m) Space
Hiroshi NAGAMOCHI Shuji NAKAMURA Toshimasa ISHII 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/02/01
Vol. E86-D  No. 2  pp. 179-185
Type of Manuscript:  Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: Graph Algorithms
Keyword: 
graphminimum cutalgorithmcactusmaximum adjacency orderingconnectivitymaximum flow
 Summary | Full Text:PDF

A Simple Proof of a Minimum Cut Algorithm and Its Applications
Hiroshi NAGAMOCHI Toshimasa ISHII Toshihide IBARAKI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/10/25
Vol. E82-A  No. 10  pp. 2231-2236
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
graphedge-connectivityminimum cutflowMA-orderingdynamic tree structure
 Summary | Full Text:PDF