研究人员开发了一种新的图着色对比学习框架，图着色是图论中的一个核心问题，在调度和资源分配中有应用。该方法旨在创建可迁移的着色几何，其中相同颜色节点的嵌入对齐，相邻节点被推开。实验表明，这种对比图神经网络（GNN）编码器泛化能力强，能产生有效的着色，通常优于传统的贪婪方法。 AI
影响 引入了一种新颖的图着色对比学习方法，有望提高调度和资源分配任务的泛化能力。
排序理由 该集群包含一篇详细介绍图着色新研究方法的学术论文。
AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →
arXiv:2606.03923v1 Announce Type: new Abstract: Graph coloring seeks to assigns colors to a graph's nodes so that adjacent nodes receive different colors, using as few colors as possible. Here, we study approximate $k$-coloring, where the goal is to use at most $k$ colors while m…
Graph coloring seeks to assigns colors to a graph's nodes so that adjacent nodes receive different colors, using as few colors as possible. Here, we study approximate $k$-coloring, where the goal is to use at most $k$ colors while minimizing the number of monochromatic edges. Thi…