Channel graphs of bit permutation networks

Full metadata record

DC Field	Value	Language
dc.contributor.author	Tong, LD	en_US
dc.contributor.author	Wang, FK	en_US
dc.contributor.author	Chang, GJ	en_US
dc.date.accessioned	2014-12-08T15:43:37Z	-
dc.date.available	2014-12-08T15:43:37Z	-
dc.date.issued	2001-07-28	en_US
dc.identifier.issn	0304-3975	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0304-3975(00)00237-1	en_US
dc.identifier.uri	http://hdl.handle.net/11536/29496	-
dc.description.abstract	Channel graphs have been widely used in the study of blocking networks. In this paper, we show that a bit pen-nutation network has a unique channel graph if and only if it is connected, and two connected bit pen-nutation networks are isomorphic if and only if their channel graphs are isomorphic. (C) 2001 Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	multistage interconnection network	en_US
dc.subject	switching network	en_US
dc.subject	channel graph	en_US
dc.title	Channel graphs of bit permutation networks	en_US
dc.type	Article; Proceedings Paper	en_US
dc.identifier.doi	10.1016/S0304-3975(00)00237-1	en_US
dc.identifier.journal	THEORETICAL COMPUTER SCIENCE	en_US
dc.citation.volume	263	en_US
dc.citation.issue	1-2	en_US
dc.citation.spage	139	en_US
dc.citation.epage	143	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000170245800014	-
Appears in Collections:	Conferences Paper

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.