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

利用爬山法有效生成单因子分解

Efficient Generation of One-Factorizations through Hill Climbing

Maya Dotan, Nati Linial

摘要:

众所周知,对于每一个偶数$n$,完全图$K_{n}$都有一个单因子分解,即一个具有$n-1$颜色的正常边染色.不幸的是,人们对大的单因子分解的可能结构知之甚少。此外,目前我们只有少得可怜的显式构造单因子分解。具体来说,我们基本上不知道大$n$的单因子分解的{ \em典型}性质。设$\cal C_{\rm n}$是一个图,其顶点集包含所有阶$n$单因子分解的集合,并且$Ψ: V(\cal C_{\rm n})\to \mathbb R$恰好在单因子分解处取其最小值.给定$\cal C_{\rm n}$和$Ψ$,我们可以通过爬山生成一因子分解。也就是说,通过在$\cal C_{\rm n}$上行走,其倾向于从顶点到较小的$Ψ$的邻居。30多年来,爬山基本上是生成许多大的一因子分解的唯一方法。然而,这些方法的有效性迄今为止仅得到数字证据的支持。在这里,我们提出了第一次爬山算法,可证明产生一个顺序$n$一因子分解在$\text{polynomial}(n)$步骤,无论起始状态,而在底层图形中的所有顶点度是适当的有界。我们还提出了许多关于爬山方法以及一因子分解的可能和典型结构的问题和猜想。

英文摘要:

It is well known that for every even integer $n$, the complete graph $K_{n}$ has a one-factorization, namely a proper edge coloring with $n-1$ colors. Unfortunately, not much is known about the possible structure of large one-factorizations. Also, at present we have only woefully few explicit constructions of one-factorizations. Specifically, we know essentially nothing about the {\em typical} properties of one-factorizations for large $n$. Suppose that $\cal C_{\rm n}$ is a graph whose vertex set includes the set of all order-$n$ one-factorizations and that $Ψ: V(\cal C_{\rm n})\to \mathbb R$ takes its minimum precisely at the one-factorizations. Given $\cal C_{\rm n}$ and $Ψ$, we can generate one-factorizations via hill climbing. Namely, by taking a walk on $\cal C_{\rm n}$ that tends to go from a vertex to a neighbor of smaller $Ψ$. For over 30 years, hill-climbing has been essentially the only method for generating many large one-factorizations. However, the validity of such methods was supported so far only by numerical evidence. Here, we present for the first time hill-climbing algorithms that provably generate an order-$n$ one-factorization in $\text{polynomial}(n)$ steps regardless of the starting state, while all vertex degrees in the underlying graph are appropriately bounded. We also raise many questions and conjectures regarding hill-climbing methods and concerning the possible and typical structure of one-factorizations.

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

↑