计算具有最小基数支配集的森林度实现
Computing Forest Degree Realizations with Minimum Cardinality Domination
AI总结:
本文针对森林族的度实现问题,研究以最小顶点覆盖、最小支配集等为目标函数的优化型度实现,给出相关问题的特征刻画与线性时间算法,且结果可扩展至最小边支配集。
摘要:
关于图族$\u2118$的度实现问题,输入为非递增正整数序列$d=(d_1,\u2026,d_n)$,目标是判断是否存在简单无向图$G \u2208 \u2118$,其度序列对应$d$,即满足$deg(G)=d$。本文考虑度实现的一种版本,要求实现图为森林(即$\u2118$为森林族)。我们研究优化型度实现,目标是找到使目标函数$f$最小的实现图$G$,即从给定序列的所有实现图中选出$f(G)$最小的那个。更具体地,我们聚焦以下函数:最优顶点覆盖的大小、最优支配集的大小,同时考虑最小顶点覆盖和最小支配集的全版本与配对版本。我们为上述所有问题提供了特征刻画及线性时间实现算法。由于最小配对顶点覆盖与最小边支配集密切相关,我们关于前者的度实现结果可扩展至后者。
英文摘要:
In the Degree Realization problem with respect to a family $\mathcal{P}$ of graphs the input is a non-increasing sequence $d = (d_1,\ldots,d_n)$ of positive integers, and the goal is to decide whether there exists a simple undirected graph $G \in \mathcal{P}$, whose degrees correspond to $d$, i.e., such that $deg(G) = d$. In this paper we consider the version of Degree Realization in which the realization is required to be a forest (i.e., $\mathcal{P}$ is the family of forests). We consider \emph{optimized} Degree Realization in which the goal is to obtain a realization that minimizes an objective function $f$. That is, the goal is to find a realization $G$ that minimizes $f(G)$ among the realizations of the given input sequence. More specifically, we focus on the following functions: the size of an optimal \emph{vertex cover} and the size of an optimal \emph{dominating set}. We also consider the \emph{total} and \emph{paired} versions of both Min Vertex Cover and Min Dominating Set. We provide characterizations and linear time realization algorithms for all the above-mentioned problems. Since Min Paired Vertex Cover is closely related to Min Edge Dominating Set, our results for Degree Realization with respect to the former extend to the latter.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。