ANALYSIS OF DYNAMIC PARTICLE FLOWS IN TIME-VARYING NETWORKS.

被引：0

作者：

Onaga, Kenji

Kyan, Seiki

机构：

来源：

Electronics and Communications in Japan (English translation of Denshi Tsushin Gakkai Zasshi) | 1977年 / 60卷 / 01期

关键词：

MATHEMATICAL TECHNIQUES - Graph Theory;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Movement of particles from network input to output is called a dynamic flow of a single kind (or commodity). This paper introduces a new method of describing dynamic flows of particles and investigates time-optimal transportation through the network. Properties of dynamic flows, optimality criteria and a procedure for constructing time-optimal flows in the network are presented.

引用

页码：30 / 38