Distributed edge coloration for bipartite networks

NCU Institutional Repository > 理學院 > 光電科學研究所 > 期刊論文 > Item 987654321/28065

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/28065

题名:	Distributed edge coloration for bipartite networks
作者:	Huang,ST;Tzeng,CH
贡献者:	光電科學研究所
关键词:	SYSTEMS;TIME;STABILIZATION;MULTIGRAPHS;ALGORITHMS;GRAPHS
日期:	2009
上传时间:	2010-06-29 19:41:09 (UTC+8)
出版者:	中央大學
摘要:	This paper presents a self-stabilizing algorithm to color the edges of a bipartite network such that any two adjacent edges receive distinct colors. The algorithm has the self-stabilizing property; it works without initializing the system. It also works in a de-centralized way without a leader computing a proper coloring for the whole system. Moreover, it finds an optimal edge coloring and its time complexity is O(n (2) k + m) moves, where k is the number of edges that are not properly colored in the initial configuration.
關聯:	DISTRIBUTED COMPUTING
显示于类别:	[光電科學研究所] 期刊論文

文件中的档案:

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

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

社群 sharing