Keyword : cactus


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(280.3KB)