当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
A fast distributed algorithm for (Δ + 1)-edge-coloring
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2021-10-28 , DOI: 10.1016/j.jctb.2021.10.004 Anton Bernshteyn
中文翻译:
(Δ+1)-边缘着色的一种快速分布式算法
更新日期:2021-10-28
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2021-10-28 , DOI: 10.1016/j.jctb.2021.10.004 Anton Bernshteyn
We present a deterministic distributed algorithm in the model that finds a proper -edge-coloring of an n-vertex graph of maximum degree Δ in rounds. This is the first nontrivial distributed edge-coloring algorithm that uses only colors (matching the bound given by Vizing's theorem). Our approach is inspired by the recent proof of the measurable version of Vizing's theorem due to Grebík and Pikhurko.
中文翻译:
(Δ+1)-边缘着色的一种快速分布式算法
我们提出了一种确定性分布式算法 找到合适的模型 最大度为 Δ的n顶点图的边着色回合。这是第一个仅使用的非平凡分布式边缘着色算法颜色(匹配 Vizing 定理给出的界限)。我们的方法的灵感来自于最近由 Grebík 和 Pikhurko 提出的 Vizing 定理的可测量版本的证明。