Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, CYen_US
dc.contributor.authorHwang, FKen_US
dc.contributor.authorLan, JKen_US
dc.date.accessioned2014-12-08T15:18:02Z-
dc.date.available2014-12-08T15:18:02Z-
dc.date.issued2005-12-01en_US
dc.identifier.issn0028-3045en_US
dc.identifier.urihttp://dx.doi.org/10.1002/net.20085en_US
dc.identifier.urihttp://hdl.handle.net/11536/13041-
dc.description.abstractEquivalence 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.isoen_USen_US
dc.subjectmultistage interconnection networksen_US
dc.subjecttopological equivalenceen_US
dc.subjectbanyan propertyen_US
dc.subjectbuddy propertyen_US
dc.subjectbit permutationen_US
dc.titleEquivalence of buddy networks with arbitrary number of stagesen_US
dc.typeArticleen_US
dc.identifier.doi10.1002/net.20085en_US
dc.identifier.journalNETWORKSen_US
dc.citation.volume46en_US
dc.citation.issue4en_US
dc.citation.spage171en_US
dc.citation.epage176en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000233505500002-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000233505500002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.