Keyword : flow network


A New Algorithm forp-Collection Problem on a Tree-Type Flow Network
Shuji TSUKIYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/01/20
Vol. E81-A  No. 1  pp. 139-146
Type of Manuscript: PAPER
Category: Graphs and Networks
Keyword: 
flow networklocation problemp-collection problemdynamic programming
  Summary |  Full Text:PDF (607.8KB)

On a Generalization of a Covering Problem Called Single Cover on Undirected Flow Networks
Hiroshi TAMURA  Hidehito SUGAWARA  Masakazu SENGOKU  Shoji SHINODA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/03/20
Vol. E80-A  No. 3  pp. 544-550
Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
Category: 
Keyword: 
graphs and networksflow networklocation theorycovering problem
  Summary |  Full Text:PDF (515.6KB)

The Problem of where to Locate p-Sinks in a Flow Network: Complexity Approach
Kaoru WATANABE  Hiroshi TAMURA  Masakazu SENGOKU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/09/20
Vol. E79-A  No. 9  pp. 1495-1503
Type of Manuscript: PAPER
Category: Graphs and Networks
Keyword: 
location problemflow networkNP-completeoptimization problem
  Summary |  Full Text:PDF (740.4KB)

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/20
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 (556.5KB)