Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, MCen_US
dc.contributor.authorLi, TKen_US
dc.contributor.authorTan, JJMen_US
dc.contributor.authorHsu, LHen_US
dc.date.accessioned2014-12-08T15:40:06Z-
dc.date.available2014-12-08T15:40:06Z-
dc.date.issued2003-11-30en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.ipl.2003.08.007en_US
dc.identifier.urihttp://hdl.handle.net/11536/27383-
dc.description.abstractThe crossed cube CQ(n) introduced by Efe has many properties similar to those of the popular hypercube. However, the diameter of CQ(n) is about one half of that of the hypercube. Failures of links and nodes in an interconnection network are inevitable. Hence, in this paper, we consider the hybrid fault-tolerant capability of the crossed cube. Letting f(e) and f(v) be the numbers of faulty edges and vertices in CQ(n), we show that a cycle of length 1, for any 4 less than or equal to l less than or equal to V(CQ(n)) - f(v) can be embedded into a wounded crossed cube as long as the total number of faults (f(v) +f(e)) is no more than n - 2, and we say that CQ(n) is (n - 2)-fault-tolerant pancyclic. This result is optimal in the sense that if there are n - 1 faults, there is no guarantee of having a cycle of a certain length in it. (C) 2003 Published by Elsevier B.V.en_US
dc.language.isoen_USen_US
dc.subjectcycle embeddingen_US
dc.subjectcrossed cubeen_US
dc.subjectpancyclicen_US
dc.subjecthamiltonianen_US
dc.subjectfault toleranceen_US
dc.titleFault-tolerant cycle-embedding of crossed cubesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ipl.2003.08.007en_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume88en_US
dc.citation.issue4en_US
dc.citation.spage149en_US
dc.citation.epage154en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000186293700002-
dc.citation.woscount44-
Appears in Collections:Articles


Files in This Item:

  1. 000186293700002.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.