完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chen, CY | en_US |
dc.contributor.author | Hwang, FK | en_US |
dc.contributor.author | Lan, JK | en_US |
dc.date.accessioned | 2014-12-08T15:18:02Z | - |
dc.date.available | 2014-12-08T15:18:02Z | - |
dc.date.issued | 2005-12-01 | en_US |
dc.identifier.issn | 0028-3045 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1002/net.20085 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/13041 | - |
dc.description.abstract | Equivalence of multistage interconnection networks is an important concept because it reduces the number of networks to be studied. Equivalence among the banyan networks has been well studied. Occasionally, the study was extended to networks obtained by concatenating two banyan networks (identifying the output stage of the preceding network with the input stage of the succeeding one). Recently, equivalence among the class of networks that are obtained from banyan networks by adding extra stages has also been studied. Note that all these above-mentioned networks are in the general class of buddy networks. In this article we study equivalence of buddy networks with an arbitrary number of stages. (c) 2005 Wiley Periodicals, Inc. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | multistage interconnection networks | en_US |
dc.subject | topological equivalence | en_US |
dc.subject | banyan property | en_US |
dc.subject | buddy property | en_US |
dc.subject | bit permutation | en_US |
dc.title | Equivalence of buddy networks with arbitrary number of stages | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1002/net.20085 | en_US |
dc.identifier.journal | NETWORKS | en_US |
dc.citation.volume | 46 | en_US |
dc.citation.issue | 4 | en_US |
dc.citation.spage | 171 | en_US |
dc.citation.epage | 176 | en_US |
dc.contributor.department | 應用數學系 | zh_TW |
dc.contributor.department | Department of Applied Mathematics | en_US |
dc.identifier.wosnumber | WOS:000233505500002 | - |
dc.citation.woscount | 1 | - |
顯示於類別: | 期刊論文 |