多项式时间上的三元图同构,在Luks之后
Ternary graph isomorphism in polynomial time, after Luks
摘要:
图同构问题在数学和计算机科学中有着悠久的历史,在计算化学和生物学中也有应用,它被认为既不是多项式时间可解的,也不是NP完全的。E.卢克在1982年提出了最好的算法,迄今为解决这个问题,而且运行在多项式时间,如果一个上限的程度,在图中的节点被视为一个常数。不幸的是,Luks的算法是纯理论的,很难在实践中使用,特别是,我们还没有能够找到它在文献中的任何实现。本文的主要目标是提出一个有效的实现该算法的三元图的SAGE系统,以及适应完全解决根系统发育网络上一组给定的类群。
英文摘要:
The graph isomorphism problem has a long history in mathematics and computer science, with applications in computational chemistry and biology, and it is believed to be neither solvable in polynomial time nor NP-complete. E. Luks proposed in 1982 the best algorithm so far for the solution of this problem, which moreover runs in polynomial time if an upper bound for the degrees of the nodes in the graphs is taken as a constant. Unfortunately, Luks' algorithm is purely theoretical, very difficult to use in practice, and, in particular, we have not been able to find any implementation of it in the literature. The main goal of this paper is to present an efficient implementation of this algorithm for ternary graphs in the SAGE system, as well as an adaptation to fully resolved rooted phylogenetic networks on a given set of taxa.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。