完整後設資料紀錄
DC 欄位語言
dc.contributor.authorShih, Lun-Minen_US
dc.contributor.authorChiang, Chieh-Fengen_US
dc.contributor.authorHsu, Lih-Hsingen_US
dc.contributor.authorTan, Jimmy J. M.en_US
dc.date.accessioned2014-12-08T15:12:18Z-
dc.date.available2014-12-08T15:12:18Z-
dc.date.issued2008-04-15en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.ipl.2007.10.009en_US
dc.identifier.urihttp://hdl.handle.net/11536/9452-
dc.description.abstractIn this paper, we study the Menger property on a class of hypercube-like networks. We show that in all n-dimensional hypercubelike networks with n - 2 vertices removed, every pair of unremoved vertices u and v are connected by min{deg(u), deg(v)} vertex-disjoint paths, where deg(u) and deg(v) are the remaining degree of vertices u and v, respectively. Furthermore, under the restricted condition that each vertex has at least two fault-free adjacent vertices, all hypercube-like networks still have the strong Menger property, even if there are up to 2n - 5 vertex faults. (C) 2007 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectstrong Menger connectivityen_US
dc.subjectconditional faultsen_US
dc.subjecthypercube-like networken_US
dc.subjectinterconnection networksen_US
dc.titleStrong Menger connectivity with conditional faults on the class of hypercube-like networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ipl.2007.10.009en_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume106en_US
dc.citation.issue2en_US
dc.citation.spage64en_US
dc.citation.epage69en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000255072500004-
dc.citation.woscount6-
顯示於類別:期刊論文


文件中的檔案:

  1. 000255072500004.pdf

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