A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs

2010
*
Journal of Supercomputing
*

During the last decades, a host of efficient algorithms have been developed for solving the minimum spanning tree problem in deterministic graphs, where the weight associated with the graph edges is assumed to be fixed. Though it is clear that the edge weight varies with time in realistic applications and such an assumption is wrong, finding the minimum spanning tree of a stochastic graph has not received the attention it merits. This is due to the fact that the minimum spanning tree problem

doi:10.1007/s11227-010-0484-1
fatcat:lpg2w3664rctrjcmj4pk37p7sm