A research about efficient algorithms for analyzing the networks with random weights

本研究是关于以图的形式计算最优解的概率分布函数，它代表了公路网、电力、计算机通信等。本研究特别针对交通拥堵等情况时有变化的情况进行研究。在研究期间，发现了以下事实。当给定图的树宽较小时，可以有效地计算出随机广播时间和随机最短时间的概率分布函数。

This research is about computing the probability distribution function of the optimal solution in graphs, which represents network of roads, electric power, computer communication and so on. This study especially focuses on the cases in which the situation changes from time to time like the traffic jams. In the study duration, the following fact was revealed. The probabilistic distribution functions of the stochastic broadcast time and the stochastic shortest time can be computed efficiently if a parameter, treewidth, of a given graph is small.