设计多项式时间算法来检验两个图是否同构,至少对于某些特殊的图类是很重要的。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.
Faster Algorithms for Finding and Counting Subgraphs
In this paper we study a natural generalization of both { \sc $k$ -Path} and { \sc $k$ -Tree} problems, namely, the { \sc Subgraph Isomorphism} problem. In the { \sc Subgraph Isomorphism} problem we are given two graphs $F$ and $G$ on $k$ and $n$ vertices respectively as an input, and the question is whether there exists a subgraph of $G$ isomorphic to $F$ . We show that if the treewidth of $F$ is at most $t$ , then there is a randomized algorithm for the { \sc Subgraph Isomorphism} problem running in time $\cO^*(2^k n^{2t})$ . To do so, we associate a new multivariate {Homomorphism polynomial…
我们介绍了深度Weisfeiler-Leman算法(DeepWL)的框架,它允许设计比著名的Weisfeiler-Leman算法更强大的纯组合图同构测试。我们证明,作为一个抽象的计算模型,多项式时间DeepWL算法具有与Blass,Gurevich和Shelah(Ann. Pure Appl. Logic.,1999年)这是一个众所周知的开放问题是否存在一个多项式时间图同构测试意味着存在一个多项式时间规范化算法。我们的主要技术结果表明,对于每一类图(满足一些温和的封闭条件),如果存在多项式时间DeepWL同构测试,则存在该类的多项式规范化算法。这意味着在这个类上还有一个捕获多项式时间的逻辑。
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
一个常用的研究方法参数化图的问题是删除距离平凡(Guo et al. 2004),它计数顶点,需要从一个图中删除,把它放在一些类,其中有效的算法是已知的。在图同构的上下文中,我们定义平凡性是指一个图的最大程度由一个常数界定,因为这样的图类承认多项式时间同构测试。我们一般删除距离的措施,我们称之为消除距离平凡,基于消除树或树深度分解。我们建立了当通过消除距离参数化到有界度时,图的规范化以及图的同构是FPT,扩展了Bouland等人的结果。