Keyword : minimum cuts


Recent Development of Graph Connectivity Augmentation Algorithms
Hiroshi NAGAMOCHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3 ; pp. 372-383
Type of Manuscript:  INVITED SURVEY PAPER
Category: Graph Algorithms
Keyword: 
edge-connectivityvertex-connectivityminimum cutsgraphsaugmentation problempolynomial algorithm
 Summary | Full Text:PDF

Computing k-Edge-Connected Components of a Multigraph
Hiroshi NAGAMOCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/04/25
Vol. E76-A  No. 4 ; pp. 513-517
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design of algorithm, computational complexitymultigraphsedge-connectivityconnected componetsmaximum flowsminimum cutspolynomial-time algorithms
 Summary | Full Text:PDF