并行网络通信的一个数学模型

A Mathematical Model for Parallel Communication Network

用边和点都带约束的图来表示某种计算机通信网络。边约束表示每次通信的时间限制；点约束表示每台计算机的通信容量。由此研究了如何规划每次通信，使总的通信时间最少的问题。做为特＊例，用本模型研究了边染色问题。

A graph with constraints on its points and edges represents some computer parallel commuinication network. Every edge constraint indicates the time spent for the corresponding communication task, and every point constraint indicates the communication capacity of the cor- responding computer. Using this model, the paper considers how to organize every communication task to minimize the total communication time of the whole network . Moreover, the Edge-Coloring* Problem is a special case of this model.