1-fault tolerant design for token rings

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Wang, JJ	en_US
dc.contributor.author	Hung, CN	en_US
dc.contributor.author	Hsu, LH	en_US
dc.date.accessioned	2014-12-08T15:27:19Z	-
dc.date.available	2014-12-08T15:27:19Z	-
dc.date.issued	1998	en_US
dc.identifier.isbn	0-8186-7225-0	en_US
dc.identifier.uri	http://hdl.handle.net/11536/19571	-
dc.description.abstract	In this paper, we present a family of 3-regular, planar, and hamiltonian graphs. Any graph in this family remains hamiltonian if any node or any edge is deleted. Moreover, the diameter of any graph in this family is O(root p) where p is the number of nodes.	en_US
dc.language.iso	en_US	en_US
dc.title	1-fault tolerant design for token rings	en_US
dc.type	Proceedings Paper	en_US
dc.identifier.journal	TWELFTH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN-12), PROCEEDINGS	en_US
dc.citation.spage	481	en_US
dc.citation.epage	483	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000072319700089	-
顯示於類別：	會議論文