期刊
INFORMATION PROCESSING LETTERS
卷 107, 期 2, 页码 60-63出版社
ELSEVIER
DOI: 10.1016/j.ipl.2008.01.002
关键词
computational complexity; graph algorithms; randomised algorithms
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which decisions are made locally with no information about the graph's global structure is particularly challenging. In this article we analyse the complexity of a decentralised colouring algorithm that has recently been proposed for channel selection in wireless computer networks. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据