@article{Touzene_Day_2014, title={On Directed Edge-Disjoint Spanning Trees in Product Networks, An Algorithmic Approach}, volume={11}, url={https://journals.squ.edu.om/index.php/tjer/article/view/149}, DOI={10.24200/tjer.vol11iss2pp79-88}, abstractNote={<p class="p1">In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs in undirected product networks. Their construction method focuses more on showing the existence of a maximum number (n<span class="s1">1</span>+n<span class="s1">2</span>-1) of EDSTs in product network of two graphs, where factor graphs have respectively n<span class="s1">1 </span>and n<span class="s1">2 </span>EDSTs. In this paper, we propose a new systematic and algorithmic approach to construct (n<span class="s1">1</span>+n<span class="s1">2</span>) directed routed EDST in the product networks. The direction of an edge is added to support bidirectional links in interconnection networks. Our EDSTs can be used straightforward to develop efficient collective communication algorithms for both models store-and-forward and wormhole.</p><p class="p1"> </p>}, number={2}, journal={The Journal of Engineering Research [TJER]}, author={Touzene, A.R. and Day, K.}, year={2014}, month={Dec.}, pages={79–88} }