AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

On the complexity of distance-2 coloring

Toronto, Ont., pp.71-74, (1992)

被引用76|浏览6
EI WOS
下载 PDF 全文
引用

摘要

The authors study the problem of distance-2 colorings of the vertices of undirected graphs. In such a coloring, vertices separated by a distance of less than or equal to two must receive different colors. This problem has direct application to the problem of broadcast scheduling in multihop radio networks. The authors show that even when ...更多

代码

数据

您的评分 :
0

 

标签
评论
小科