.png){kind=icon}
返回
Fast, Responsive Decentralized Graph Coloring
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2017.2751544.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graph coloring problem arises in numerous networking applications. We solve it in a fully decentralized way (i. e., with no message passing). We propose a novel algorithm that is automatically responsive to topology changes, and we prove that it converges to a proper coloring in O(N logN) time with high probability for generic graphs, when the number of available colors is greater than Delta, the maximum degree of the graph, and in O(logN) time if Delta = O(1). We believe the proof techniques used in this paper are of independent interest and provide new insight into the properties required to ensure fast convergence of decentralized algorithms.
Keyword:
Graph theory
network theory (graphs)
wireless networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks多无线电无线Mesh网络中的最小干扰信道分配
PREAI
分享收藏Distributed channel assignment and routing in multiradio multichannel multihop wireless networks多无线电多信道多跳无线网络中的分布式信道分配和路由
PREAI
分享收藏
查看更多内容