On Directed Edge-Disjoint Spanning Trees in Product Networks, An Algorithmic Approach
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 (n1+n2-1) of EDSTs in product network of two graphs, where factor graphs have respec...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sultan Qaboos University
2014-12-01
|
| Series: | The Journal of Engineering Research |
| Subjects: | |
| Online Access: | https://journals.squ.edu.om/index.php/tjer/article/view/149 |