ASIA unversity:Item 310904400/5818
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90437/105768 (86%)
造访人次 : 10944377      在线人数 : 733
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 資訊學院 > 會議論文 >  Item 310904400/5818


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/5818


    题名: Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model
    作者: Cheng-Kuan Lin;Jimmy J. M. Tan;Lih-Hsing Hsu;Eddie Cheng;L´aszl´o Lipt´ak
    贡献者: Oakland University;National Chiao Tung University
    日期: 2007-12-20
    上传时间: 2009-12-15
    出版者: 亞洲大學資訊學院;中華電腦學會
    摘要: The diagnosis of faulty processors plays an important role in multiprocessor systems for reliable computing, and the diagnosability of manywell-known networks has been explored. Zheng et al. showed that the diagnosability of the n-dimensional star graph Sn is n − 1. Lai et al. introduced a restricted diagnosability of multiprocessor systems called conditional diagnosability. They consider the situation when no faulty set can contain all the neighbors of any vertex in the system. In this paper, we study the conditional diagnosability of Cayley graphs generated by transposition trees (which include the star graphs) under the comparison model, and show that it is 3n − 8 for n ≥ 4, except for the n-dimensional star graph, for which it is 3n − 7.
    關聯: 2007NCS全國計算機會議 12-20~21
    显示于类别:[資訊學院] 會議論文

    文件中的档案:

    档案 大小格式浏览次数
    9012.pdf97KbAdobe PDF534检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈