arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1009.0358cs.CCcs.DS
收藏

树结构三图表同态问题的二分法

Dichotomy for tree-structured trigraph list homomorphism problems

Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho

摘要:

三图列表同态问题(也称为列表矩阵划分问题)最近引起了人们的兴趣,部分原因是有一些具体的问题不知道是多项式时间可解的或NP-完全的。因此,虽然有向图列表同态问题享有二分法(每个问题是NP完全或多项式时间可解),这样的二分法不一定是预期的三图列表同态问题。然而,在本文中,我们确定了一个大类的三图列表同态问题表现出二分法。它们由具有树状结构的三元图组成,特别是包括其基础图是树的所有三元图。事实上,我们表明,对于这些树状三图,三图列表同态问题是多项式等价于一个相关的有向图列表同态问题。我们还描述了几个例子,说明我们的条件定义树状三图是不自然的,因为放松他们可能会导致更难的问题。

英文摘要:

Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP-complete. Thus while digraph list homomorphism problems enjoy dichotomy (each problem is NP-complete or polynomial time solvable), such dichotomy is not necessarily expected for trigraph list homomorphism problems. However, in this paper, we identify a large class of trigraphs for which list homomorphism problems do exhibit a dichotomy. They consist of trigraphs with a tree-like structure, and, in particular, include all trigraphs whose underlying graphs are trees. In fact, we show that for these tree-like trigraphs, the trigraph list homomorphism problem is polynomially equivalent to a related digraph list homomorphism problem. We also describe a few examples illustrating that our conditions defining tree-like trigraphs are not unnatural, as relaxing them may lead to harder problems.

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

↑