arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.12243cs.DCcs.DS
收藏

高度图中的分布式二值标记问题

Distributed Binary Labeling Problems in High-Degree Graphs

Henrik Lievonen, Timothé Picavet, Jukka Suomela

AI总结:

本研究针对二值标记问题,将复杂度作为n、d、δ的函数分析,提出结构简单问题族并分类其复杂度,证明Θ_{d,δ}(log n)类问题的具体复杂度形式,还给出了适配高度节点的改进rake-and-compress技术。

摘要:

Balliu等人(DISC 2020)对用分布式图算法求解二值标记问题的难度进行了分类;这类问题的任务是在一棵2着色树中选择边的子集,其中度数为d的白色节点与度数为δ的黑色节点对所选关联边的数量存在约束。他们证明,任何此类问题的确定性轮复杂度为O_{d,δ}(1)、Θ_{d,δ}(log n)、Θ_{d,δ}(n),或者问题不可解。但他们的分类仅将复杂度表示为n的函数,其中O_{d,δ}隐藏了可能依赖于参数d和δ的常数。\n在本研究中,我们将二值标记问题的复杂度作为n、d、δ三个参数的函数展开研究。为此,我们提出了结构简单问题族,其中包括所有基数约束可用上下文无关文法表示的二值标记问题等。我们对结构简单问题的可能复杂度进行了分类。作为核心结果,我们证明:若某问题的复杂度属于Θ_{d,δ}(log n)这一大类,则对于每个d和δ,其复杂度始终为Θ(log_d n)、Θ(log_δ n)或Θ(log n)中的一种。\n为证明我们的上界,我们提出了一种全新的、更激进的rake-and-compress(耙压)技术版本,该版本可从高度节点中获益。

英文摘要:

Balliu et al. (DISC 2020) classified the hardness of solving binary labeling problems with distributed graph algorithms; in these problems the task is to select a subset of edges in a $2$-colored tree in which white nodes of degree $d$ and black nodes of degree $δ$ have constraints on the number of selected incident edges. They showed that the deterministic round complexity of any such problem is $O_{d,δ}(1)$, $Θ_{d,δ}(\log n)$, or $Θ_{d,δ}(n)$, or the problem is unsolvable. However, their classification only addresses complexity as a function of $n$; here $O_{d,δ}$ hides constants that may depend on parameters $d$ and $δ$. In this work we study the complexity of binary labeling problems as a function of all three parameters: $n$, $d$, and $δ$. To this end, we introduce the family of structurally simple problems, which includes, among others, all binary labeling problems in which cardinality constraints can be represented with a context-free grammar. We classify possible complexities of structurally simple problems. As our main result, we show that if the complexity of a problem falls in the broad class of $Θ_{d,δ}(\log n)$, then the complexity for each $d$ and $δ$ is always either $Θ(\log_d n)$, $Θ(\log_δn)$, or $Θ(\log n)$. To prove our upper bounds, we introduce a new, more aggressive version of the rake-and-compress technique that benefits from high-degree nodes.

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

↑