Optimal Edge-Disjoint Spanning Trees in HyperStar Interconnection Network HS(2n,n) 


Vol. 15,  No. 6, pp. 345-350, Dec.  2008
10.3745/KIPSTA.2008.15.6.345


PDF
  Abstract

Recently, a HyperStar network HS(2n,n) has been introduced as a new interconnection network of new topology for parallel processing. HyperStar network has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show a construction algorithm of edge-disjoint spanning trees in HyperStar network HS(2n,n). Also, we prove that edge-disjoint spanning tree by the algorithm is optimal.

  Statistics
  Cite this article

[IEEE Style]

J. S. Kim, S. W. Kim, H. O. Lee, "Optimal Edge-Disjoint Spanning Trees in HyperStar Interconnection Network HS(2n,n)," The KIPS Transactions:PartA, vol. 15, no. 6, pp. 345-350, 2008. DOI: 10.3745/KIPSTA.2008.15.6.345.

[ACM Style]

Jong Seok Kim, Sung Won Kim, and Hyeong Ok Lee. 2008. Optimal Edge-Disjoint Spanning Trees in HyperStar Interconnection Network HS(2n,n). The KIPS Transactions:PartA, 15, 6, (2008), 345-350. DOI: 10.3745/KIPSTA.2008.15.6.345.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals