arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.05772cs.DMmath.CO
收藏

线性时间下具有树骨干的团的λ-骨干着色研究

On λ-backbone coloring of cliques with tree backbones in linear time

Krzysztof Michalik, Krzysztof Turowski

AI总结:

该研究提出线性时间算法解决带树/森林骨干的团的λ-骨干着色问题,实现加性误差的绝对近似,并构造出下界构造证明近似阶的紧性。

摘要:

图G及其子图(也称为骨干)H的λ-骨干着色是一个函数c: V(G)→{1,…,k},需保证c是G的正常着色,且对于每条边{u,v}∈E(H),都满足|c(u)-c(v)|≥λ。本文提出了一种线性时间算法,用于对带有树和森林骨干的团进行着色,其使用的最大颜色数不超过max{n, 2λ} + Δ(H)²⌈logn⌉。该结果改进了现有的近似算法,它是(Δ(H)²⌈logn⌉)-绝对近似的,即相对于最优解的误差为加性误差。我们还提出了一类Δ(T)=3的无限树族T,当λ接近n/2时,对带有骨干T的团进行着色至少需要使用max{n, 2λ} + Ω(logn)种颜色。

英文摘要:

A $λ$-backbone coloring of a graph $G$ with its subgraph (also called a backbone) $H$ is a function $c \colon V(G) \rightarrow \{1,\dots, k\}$ ensuring that $c$ is a proper coloring of $G$ and for each $\{u,v\} \in E(H)$ it holds that $|c(u) - c(v)| \ge λ$. In this paper we propose a way to color cliques with tree and forest backbones in linear time that the largest color does not exceed $\max\{n, 2 λ\} + Δ(H)^2 \lceil\log{n} \rceil$. This result improves on the previously existing approximation algorithms as it is $(Δ(H)^2 \lceil\log{n} \rceil)$-absolutely approximate, i.e. with an additive error over the optimum. We also present an infinite family of trees $T$ with $Δ(T) = 3$ for which the coloring of cliques with backbones $T$ require to use at least $\max\{n, 2 λ\} + Ω(\log{n})$ colors for $λ$ close to $\frac{n}{2}$.

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

↑