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

多项式时间上的三价图同构

Trivalent Graph isomorphism in polynomial time

Adria Alcala Mena

摘要:

设计多项式时间算法来检验两个图是否同构,至少对于某些特殊的图类是很重要的。Eugene M. Luks(1981)在作品\textit{Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time}中。可惜,这只是一个理论算法,很难付诸实践。另一方面,虽然Galil、Hoffman和Luks(1983)显示了在$O(n^3 \log n)$中运行的该算法的改进,但是没有已知的算法实现。本硕士论文的两个主要目标是更仔细地解释Luks(1981)的算法,包括详细的复杂性研究,然后在SAGE系统中提供一个有效的实现。全文共分四章和一个附录。

英文摘要:

It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time}. Unfortunately, it was a theoretical algorithm and was very difficult to put into practice. On the other hand, there is no known implementation of the algorithm, although Galil, Hoffman and Luks(1983) shows an improvement of this algorithm running in $O(n^3 \log n)$. The two main goals of this master thesis are to explain more carefully the algorithm of Luks(1981), including a detailed study of the complexity and, then to provide an efficient implementation in SAGE system. It is divided into four chapters plus an appendix.

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

↑