Keyword : minimum cut


Probabilistic Analysis on Minimum s-t Cut Capacity of Random Graphs with Specified Degree Distribution
Yuki FUJII Tadashi WADAYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/12/01
Vol. E97-A  No. 12 ; pp. 2317-2324
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
minimum cutrandom graphsLDGM code
 Summary | Full Text:PDF(572.9KB)

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)

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

Optimal Task Assignment in Hypercube Networks
Sang-Young CHO Cheol-Hoon LEE Myunghwan KIM 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/04/25
Vol. E75-A  No. 4 ; pp. 504-511
Type of Manuscript:  Special Section PAPER (Special Issue on Discrete Mathematics and Its Application)
Category: 
Keyword: 
combinatorial algorithmhomogeneous networkhypercube networkmaximum flowminimum cutnetwork flowoptimal algorithmtask assignment
 Summary | Full Text:PDF(679.5KB)