%0 Journal Article
	%A Weng Ming Chu
	%D 2009
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 32, 2009
	%T An efficient Activity Network Reduction Algorithm based on the Label Correcting Tracing Algorithm
	%U https://publications.waset.org/pdf/15982
	%V 32
	%X When faced with stochastic networks with an uncertain
duration for their activities, the securing of network completion time
becomes problematical, not only because of the non-identical pdf of
duration for each node, but also because of the interdependence of
network paths. As evidenced by Adlakha & Kulkarni [1], many
methods and algorithms have been put forward in attempt to resolve
this issue, but most have encountered this same large-size network
problem. Therefore, in this research, we focus on network reduction
through a Series/Parallel combined mechanism. Our suggested
algorithm, named the Activity Network Reduction Algorithm
(ANRA), can efficiently transfer a large-size network into an S/P
Irreducible Network (SPIN). SPIN can enhance stochastic network
analysis, as well as serve as the judgment of symmetry for the Graph
Theory.
	%P 2064 - 2072