Keyword : maximum flow


The Improvement of the Processes of a Class of Graph-Cut-Based Image Segmentation Algorithms
Shengxiao NIU Gengsheng CHEN 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/12/01
Vol. E99-D  No. 12 ; pp. 3053-3059
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
graph cutimage segmentationenergy functionmaximum flow
 Summary | Full Text:PDF(906.3KB)

Incremental Digital Content Object Delivering in Distributed Systems
Lung-Pin CHEN I-Chen WU William CHU Jhen-You HONG Meng-Yuan HO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/06/01
Vol. E93-D  No. 6 ; pp. 1512-1520
Type of Manuscript:  PAPER
Category: Data Engineering, Web Information Systems
Keyword: 
content delivery networkincremental algorithmmaximum flow
 Summary | Full Text:PDF(382.1KB)

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)

On a Realization of "Flow-Saturation" by Adding Edges in an Undirected Vertex-Capacitated Network
Yoshihiro KANEKO Shoji SHINODA Kazuo HORIUCHI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/12/25
Vol. E75-A  No. 12 ; pp. 1785-1792
Type of Manuscript:  PAPER
Category: Graphs, Networks and Matroids
Keyword: 
graphs and networksmaximum flowedge additionvertex-capacitatedundirected
 Summary | Full Text:PDF(738.8KB)

Some Covering Problems in Location Theory on Flow Networks
Hiroshi TAMURA Masakazu SENGOKU Shoji SHINODA Takeo ABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/06/25
Vol. E75-A  No. 6 ; pp. 678-684
Type of Manuscript:  Special Section PAPER (Special Section of Papers Selected from 1991 Joint Technical Conference on Circuits/Systems, Computers and Communications (JTC-CSCC '91))
Category: Combinational/Numerical/Graphic Algorithms
Keyword: 
graphs and networksflow networklocation theorycovering problemmaximum flow
 Summary | Full Text:PDF(555.1KB)

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)