完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYang, Jinn–Shyong
dc.contributor.authorWang, Yue–Li
dc.contributor.authorTang, Shyue-Ming
dc.date.accessioned2009-06-02T06:37:40Z
dc.date.accessioned2020-05-25T06:41:23Z-
dc.date.available2009-06-02T06:37:40Z
dc.date.available2020-05-25T06:41:23Z-
dc.date.issued2006-10-18T07:47:29Z
dc.date.submitted2004-12-15
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/1857-
dc.description.abstractThis paper is concerned with a particular family of regular 4-connected graphs, called chordal rings. Chordal rings are a variation of ring networks. By adding extra two links (or chords) at each vertex in a ring network, the reliability and fault-tolerance of the network are enhanced. Two spanning trees on a graph are said to be independent if they are rooted at the same vertex, say r, and for each vertex v 6= r, the two paths from r to v, one path in each tree, are internally disjoint. A set of spanning trees on a given graph is said to be independent if they are pairwise independent. In 1999, Y. Iwasaki et al. proposed a linear time algorithm to find four independent spanning trees on a chordal ring. In this paper, we shall give new algorithms to generate four independent spanning trees with reduced height in each tree.
dc.description.sponsorship大同大學,台北市
dc.format.extent6p.
dc.format.extent408626 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries2004 ICS會議
dc.subjectchordal rings
dc.subjectinterconnection networks
dc.subjectfault-tolerant broadcasting
dc.subjectindependent spanning trees
dc.subjectinternally disjoint path
dc.subject.otherNetwork and IPv6
dc.titleReducing the height of independent spanning trees in chordal rings
分類:2004年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002004000058.pdf399.05 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。