期刊论文详细信息
| International journal of computers, communications and control | |
| Two Flow Problems in Dynamic Networks | |
| Camelia Schiopu1 Eleonor Ciurea1 | |
| [1] Transilvania University of BrasovRomania, 500091 Brasov, Iului Maniu, 50 | |
| 关键词: dynamic networks; feasible flow; bipartite network; maximum flow; | |
| DOI : 10.15837/ijccc.2017.1.2786 | |
| 学科分类：计算机科学（综合） | |
| 来源: Universitatea Agora | |
 PDF
|
|
【 摘 要 】
In this paper we study two flow problems: the feasible flow problem in dynamic networks and the maximum flow problem in bipartite dynamic networks with lower bounds. We mention that the maximum flow problem in bipartite dynamic networks with lower bound was presented in paper [8]a. For these problems we give examples.
【 授权许可】
Free
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201902195348252ZK.pdf | 519KB |  download |
878987797
028-85220240
