An efficient distributed algorithm for canonical labeling on directed split-stars

文化大學機構典藏 CCUR > 商學院 > 資訊管理學系暨資訊管理研究所 > 期刊論文 > Item 987654321/16963

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/16963

题名:	An efficient distributed algorithm for canonical labeling on directed split-stars
作者:	王福星
贡献者:	資管系
关键词:	Directed split-stars Distributed algorithms Canonical labeling Message complexity Time complexity
日期:	2008-11
上传时间:	2010-09-23 15:07:58 (UTC+8)
摘要:	We consider the problem of canonical labeling in anonymous directed split-stars. This paper proposes a distributed algorithm for finding the vertex sets with specified leading symbols in directed split-stars and which has a linear message and constant time complexity. The algorithm runs on an asynchronous timing model without shared memory. In addition, our algorithm generalizes the previous distributed algorithms on directed split-stars that we know.
關聯:	Discrete Applied Mathematics V.156 P.3475-3482
显示于类别:	[資訊管理學系暨資訊管理研究所 ] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	734	检视/开启

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