On a realization problem from non-terminal capacity matrices on undirected flow networks

被引:0
|
作者
Tamara, H [1 ]
Sengoku, M
Shinoda, S
Abe, T
机构
[1] Niigata Inst Technol, Dept Informat & Elect Engn, Kashiwazaki, Chiba 9451195, Japan
[2] Niigata Univ, Fac Engn, Niigata 9502181, Japan
[3] Chuo Univ, Fac Sci & Engn, Tokyo 1128551, Japan
关键词
graph theory; flow network; terminal capacity matrix; realization problem; NP-complete;
D O I
10.1002/ecjc.1054
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The problem of realizing a given matrix on an undirected flow network has been studied and various results have been obtained. Most of these results consist of necessary and sufficient conditions for methods of realization in which the maximum good flow between the two points and the matrix components coincide. However, there are cases in which coincidence is not required as long as they are close to each other. In this paper, we consider the realization under certain conditions when values not necessarily realizable as maximum good flows of the flow network are given between two points. First, the upper and lower bounds of the maximum good flow are given. The problem of realization between these two extremes is studied and the necessary and sufficient condition is given. Next, by means of this result, we consider the problem of minimizing the difference between the given value and the maximum good flow in the undirected flow network. A realization method is studied. (C) 2001 Scripta Technica, Electron Comm Jpn Pt 3, 84(12): 28-39, 2001.
引用
收藏
页码:28 / 39
页数:12
相关论文
共 44 条