Constructing Algorithm of Edge-Disjoint Spanning Trees in Even Interconnection Network Ed


The KIPS Transactions:PartA, Vol. 17, No. 3, pp. 113-120, Jun. 2010
10.3745/KIPSTA.2010.17.3.113,   PDF Download:

Abstract

Even networks were introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties and algorithms such as simple routing algorithms, maximal fault tolerance, node disjoint path. Introduced routing algorithms and node disjoint path algorithms are proven to be optimal. However, it has not been introduced to constructing scheme for edge-disjoint spanning trees in even networks. The design of edge-disjoint spanning trees is a useful scheme to analyze for measuring the efficiency of fault tolerant of interconnection network and effective broadcasting. Introduced routing algorithm or node disjoint path algorithm are for the purpose of routing or node disjoint path hence they are not applicable to constitute edge disjoint spanning tree. In this paper, we show a construction algorithm of edge-disjoint spanning trees in even network Ed.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Kim and S. W. Kim, "Constructing Algorithm of Edge-Disjoint Spanning Trees in Even Interconnection Network Ed," The KIPS Transactions:PartA, vol. 17, no. 3, pp. 113-120, 2010. DOI: 10.3745/KIPSTA.2010.17.3.113.

[ACM Style]
Jong Seok Kim and Sung Won Kim. 2010. Constructing Algorithm of Edge-Disjoint Spanning Trees in Even Interconnection Network Ed. The KIPS Transactions:PartA, 17, 3, (2010), 113-120. DOI: 10.3745/KIPSTA.2010.17.3.113.