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

关于非负权有向图同态的一个可判定二分法

A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights

Jin-Yi Cai, Xi Chen

摘要:

图同态问题的复杂性一直是人们研究的热点。给出有向图同态的配分函数的(可判定的)复杂性二分法是一个长期存在的公开问题。本文证明了该问题的一个可判定的复杂性二分法定理,并且该定理适用于该问题的所有非负加权形式:给定任意具有非负代数元素的固定矩阵A,来自任意有向图G的有向图同态的划分函数ZA(G)要么在多项式时间内易处理,要么是#P-难的,取决于矩阵A.二分法定理的证明是组合的,但涉及到一个无限族图同态问题的定义。它的可判定性的证明是代数使用多项式的性质。

英文摘要:

The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this paper, we prove a decidable complexity dichotomy theorem for this problem and our theorem applies to all non-negative weighted form of the problem: given any fixed matrix A with non-negative algebraic entries, the partition function Z_A(G) of directed graph homomorphisms from any directed graph G is either tractable in polynomial time or #P-hard, depending on the matrix A. The proof of the dichotomy theorem is combinatorial, but involves the definition of an infinite family of graph homomorphism problems. The proof of its decidability is algebraic using properties of polynomials.

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

↑