arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.12973cs.DScs.CC
收藏

和标号的空间复杂度

The Space Complexity of Sum Labelling

Henning Fernau, Kshitij Gajjar

摘要:

一个图称为和图,如果它的顶点可以用不同的正整数标号,使得两个顶点之间存在一条边当且仅当它们的标号之和是图的另一个顶点的标号。大多数关于和图的论文考虑组合问题,例如需要添加到给定图以使其成为和图的孤立顶点的最小数量。本文从计算复杂性的角度出发,对和图进行了研究。注意,每个$n$ -顶点和图可以由$n$正整数的排序列表表示,其中边查询可以在$O(\log n)$时间内回答。因此,限制顶点标签的大小也限制了在数据库中存储图的空间复杂度。我们证明了每个$n$ -点,$m$ -边,$d$ -退化图都可以通过添加至多$m$孤立点而成为和图,使得每个点标号的大小至多为$O(n^2d)$ .这使我们能够使用存储器的$O(m\log n)$位来存储图形。对于稀疏图(具有$O(n)$边的图),这匹配$Ω(n\log n)$的平凡下界。由于平面图和森林具有常数退化,我们的结果意味着$O(n^2)$的标签大小的上界。以前最著名的关于具有最小孤立顶点数的一般图的标签大小的上界是$O(4^n)$,这是由Kratochvíl,Miller和Nguyen提出的。此外,他们的证明是存在的,而我们的标记可以在多项式时间内构造。

英文摘要:

A graph is called a sum graph if its vertices can be labelled by distinct positive integers such that there is an edge between two vertices if and only if the sum of their labels is the label of another vertex of the graph. Most papers on sum graphs consider combinatorial questions like the minimum number of isolated vertices that need to be added to a given graph to make it a sum graph. In this paper, we initiate the study of sum graphs from the viewpoint of computational complexity. Notice that every $n$-vertex sum graph can be represented by a sorted list of $n$ positive integers where edge queries can be answered in $O(\log n)$ time. Therefore, limiting the size of the vertex labels also upper-bounds the space complexity of storing the graph in the database. We show that every $n$-vertex, $m$-edge, $d$-degenerate graph can be made a sum graph by adding at most $m$ isolated vertices to it, such that the size of each vertex label is at most $O(n^2d)$. This enables us to store the graph using $O(m\log n)$ bits of memory. For sparse graphs (graphs with $O(n)$ edges), this matches the trivial lower bound of $Ω(n\log n)$. Since planar graphs and forests have constant degeneracy, our result implies an upper bound of $O(n^2)$ on their label size. The previously best known upper bound on the label size of general graphs with the minimum number of isolated vertices was $O(4^n)$, due to Kratochvíl, Miller & Nguyen. Furthermore, their proof was existential, whereas our labelling can be constructed in polynomial time.

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

↑