论文信息 - Minimal spanning trees in undirected networks with exponentially distributed arc weights

Minimal spanning trees in undirected networks with exponentially distributed arc weights

On developpe des algorithmes de calcul de la distribution et des moments du poids de l'arbre de recouvrement minimal dans un reseau non oriente avec des poids d'arcs independants et a distribution exponentielle

Vidyadhar G. Kulkarni

[1] E. A. Timofeev. Random Minimal Trees , 1985 .

[2] E. N. Gilbert. Random Minimal Trees , 1965 .

[3] Hiroaki Ishii,et al. Stochastic bottleneck spanning tree problem , 1983, Networks.

[4] Hiroaki Ishii,et al. Stochastic spanning tree problem , 1981, Discret. Appl. Math..

[5] Alan M. Frieze,et al. On the value of a random minimum spanning tree problem , 1985, Discret. Appl. Math..

[6] V. G. Kulkarni,et al. Shortest paths in networks with exponentially distributed arc lengths , 1986, Networks.