Christmas tree: A versatile 1-fault-tolerant design for token rings

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Hung, CN	en_US
dc.contributor.author	Hsu, LH	en_US
dc.contributor.author	Sung, TY	en_US
dc.date.accessioned	2014-12-08T15:46:08Z	-
dc.date.available	2014-12-08T15:46:08Z	-
dc.date.issued	1999-10-29	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://hdl.handle.net/11536/31025	-
dc.description.abstract	The token ring topology is required in token passing approach used in distributed operating systems. Fault tolerance is also required in the designs of distributed systems. Note that 1-fault-tolerant design for token rings is equivalent to design of 1-Hamiltonian graphs. This paper introduces a new family of graphs called Christmas tree, denoted by CT(s). The graph CT(s) is a 3-regular, planar, 1-Hamiltonian, and Hamiltonian-connected graph. The number of nodes in CT(s) is 3.2(s) - 2. Its diameter is 1 if s = 1, 3 if s = 2, and 2s if s greater than or equal to 3. (C) 1999 Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	diameter	en_US
dc.subject	Hamiltonian	en_US
dc.subject	1-Hamiltonian	en_US
dc.subject	Hamiltonian-connected	en_US
dc.subject	fault-tolerant	en_US
dc.subject	token rings	en_US
dc.title	Christmas tree: A versatile 1-fault-tolerant design for token rings	en_US
dc.type	Article	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	72	en_US
dc.citation.issue	1-2	en_US
dc.citation.spage	55	en_US
dc.citation.epage	63	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000084160100008	-
dc.citation.woscount	8	-
顯示於類別：	期刊論文

文件中的檔案：

000084160100008.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。