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

双阈值图的线性时间识别

Linear-Time Recognition of Double-Threshold Graphs

Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno

摘要:

一个图$G = (V,E)$是一个双阈值图,如果存在一个顶点权函数$w \colon V \to \mathbb{R}$和两个实数$\mathtt{lb}, \mathtt{ub} \in \mathbb{R}$使得$uv \in E$当且仅当$\mathtt{lb} \le \mathtt{w}(u) + \mathtt{w}(v) \le \mathtt{ub}$ .在文献中,这些图也被研究为具有星作为其基础树的成对相容图。我们给出了双阈值图的一个新的特征,将它们与二部置换图联系起来。利用新的特征,我们提出了一个识别双阈值图的线性时间算法。在我们的工作之前,Xiao和Nagamochi的已知最快算法[Jummica 2020]在$O(n^{3} m)$时间内运行,其中$n$和$m$分别是顶点和边的数量。

英文摘要:

A graph $G = (V,E)$ is a double-threshold graph if there exist a vertex-weight function $w \colon V \to \mathbb{R}$ and two real numbers $\mathtt{lb}, \mathtt{ub} \in \mathbb{R}$ such that $uv \in E$ if and only if $\mathtt{lb} \le \mathtt{w}(u) + \mathtt{w}(v) \le \mathtt{ub}$. In the literature, those graphs are studied also as the pairwise compatibility graphs that have stars as their underlying trees. We give a new characterization of double-threshold graphs that relates them to bipartite permutation graphs. Using the new characterization, we present a linear-time algorithm for recognizing double-threshold graphs. Prior to our work, the fastest known algorithm by Xiao and Nagamochi [Algorithmica 2020] ran in $O(n^{3} m)$ time, where $n$ and $m$ are the numbers of vertices and edges, respectively.

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

↑