arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.02415cs.DS
收藏

面向$(Δ+1)$-边着色的密度敏感算法

Density-Sensitive Algorithms for $(Δ+ 1)$-Edge Coloring

Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon

AI总结:

本文针对$(Δ+1)$-边着色问题,利用图的荫度$α$与最大度$Δ$之间的差距,提出一种密度敏感算法,将经典时间界改进$\frac{α}{Δ}$倍,并在有界荫度图等情形下实现近线性运行时间。

摘要:

Vizing定理断言任何图$G$都存在一个$(Δ+1)$-边着色,其中$Δ=Δ(G)$表示图$G$的最大度。目前已知若干多项式时间的$(Δ+1)$-边着色算法,在忽略多对数因子的情况下,最先进的运行时间上界为$\tilde{O}(\min\{m \cdot \sqrt{n}, m \cdot Δ\})$,该结果由Gabow等人于1985年给出,其中$n$和$m$分别表示图的顶点数和边数。($\tilde{O}$记号隐藏了多对数因子。)最近,Sinnamon从Gabow等人的时间界中去掉了一个多对数因子。图$G$的荫度$α=α(G)$是指将其边集划分为边不相交森林所需的最少数目,它是图“均匀密度”的一种度量。虽然任何图中都有$α\le Δ$,但许多自然图和现实世界图在$α$与$Δ$之间表现出显著差距。本文设计了一个$(Δ+1)$-边着色算法,其运行时间为$\tilde{O}(\min\{m \cdot \sqrt{n}, m \cdot Δ\})\cdot \frac{α}{Δ}$,从而将长期存在的时间障碍改进了$\frac{α}{Δ}$倍。特别地,对于有界荫度图(即$α=\tilde{O}(1)$)以及当$α=\tilde{O}(\frac{Δ}{\sqrt{n}})$时,我们实现了近线性运行时间。我们的算法建立在Sinnamon算法的基础上,可视为对其的一种密度敏感改进。

英文摘要:

Vizing's theorem asserts the existence of a $(Δ+1)$-edge coloring for any graph $G$, where $Δ= Δ(G)$ denotes the maximum degree of $G$. Several polynomial time $(Δ+1)$-edge coloring algorithms are known, and the state-of-the-art running time (up to polylogarithmic factors) is $\tilde{O}(\min\{m \cdot \sqrt{n}, m \cdot Δ\})$, by Gabow et al.\ from 1985, where $n$ and $m$ denote the number of vertices and edges in the graph, respectively. (The $\tilde{O}$ notation suppresses polylogarithmic factors.) Recently, Sinnamon shaved off a polylogarithmic factor from the time bound of Gabow et al. The {arboricity} $α= α(G)$ of a graph $G$ is the minimum number of edge-disjoint forests into which its edge set can be partitioned, and it is a measure of the graph's "uniform density". While $α\le Δ$ in any graph, many natural and real-world graphs exhibit a significant separation between $α$ and $Δ$. In this work we design a $(Δ+1)$-edge coloring algorithm with a running time of $\tilde{O}(\min\{m \cdot \sqrt{n}, m \cdot Δ\})\cdot \fracαΔ$, thus improving the longstanding time barrier by a factor of $\fracαΔ$. In particular, we achieve a near-linear runtime for bounded arboricity graphs (i.e., $α= \tilde{O}(1)$) as well as when $α= \tilde{O}(\fracΔ{\sqrt{n}})$. Our algorithm builds on Sinnamon's algorithm, and can be viewed as a density-sensitive refinement of it.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑