Distributive graph algorithms Global solutions from local data
Distributive graph algorithms Global solutions from local data
复制标题
DOI：
10.1109/sfcs.1987.20
复制
发表时间：
1987-10
期刊：
影响因子：
--
通讯作者：
N. Linial
中科院分区：
文献类型：
--
作者：
N. Linial
本文处理分布式算法。在n周期中设置的速度比ω（log* n）更快，并且[cv]是最佳的。 δ是具有n顺序的G中最大的程度，然后随时间O（log*n），它可以用O（δ2）颜色颜色。
This paper deals with distributed graph algorithms. Processors reside in the vertices of a graph G and communicate only with their neighbors. The system is synchronous and reliable, there is no limit on message lengths and local computation is instantaneous. The results: A maximal independent set in an n-cycle cannot be found faster than Ω(log* n) and this is optimal by [CV]. The d-regular tree of radius r cannot be colored with fewer than √d colors in time 2r / 3. If Δ is the largest degree in G which has order n, then in time O(log*n) it can be colored with O(Δ2) colors.