Necessary and sufficient conditions for rearrangeable Log(d) (N, m, p)

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hwang, FK	en_US
dc.contributor.author	Lin, WD	en_US
dc.date.accessioned	2014-12-08T15:17:55Z	-
dc.date.available	2014-12-08T15:17:55Z	-
dc.date.issued	2005-12-01	en_US
dc.identifier.issn	0090-6778	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/TCOMM.2005.860073	en_US
dc.identifier.uri	http://hdl.handle.net/11536/12985	-
dc.description.abstract	We extend previous results on sufficient conditions for rearrangeable Log(2) (N, m, p) networks to Log(d) (N, m, p) networks. We show that the original argument using path-intersecting graphs cannot be extended to d > 2, and we give a new argument. Further, we show our sufficient conditions are also necessary.	en_US
dc.language.iso	en_US	en_US
dc.subject	Banyan networks.	en_US
dc.subject	Log(N, k, p) networks	en_US
dc.subject	rearrangeable networks	en_US
dc.title	Necessary and sufficient conditions for rearrangeable Log(d) (N, m, p)	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1109/TCOMM.2005.860073	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON COMMUNICATIONS	en_US
dc.citation.volume	53	en_US
dc.citation.issue	12	en_US
dc.citation.spage	2020	en_US
dc.citation.epage	2023	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000234040700010	-
dc.citation.woscount	3	-
Appears in Collections:	Articles

Files in This Item:

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.