Research on algorithms based on graph minor theory

虽然基于图子式理论的算法在多项式时间内运行，但它们在理论上和实际上都远远不是有效的算法。在这项研究中，我们给出了一个快速算法的不相交的路径问题与固定数量的终端对，它提高了运行时间从O（n^3）到O（n^2），其中n是输入图的数量。此外，对于输入图为受限类的一些问题，我们给出了一个更简单、更快速的算法。

Although algorithms based on the graph minor theory run in polynomial time, they are theoretically and practically far from efficient algorithms. In this research, we gave a faster algorithm for the disjoint paths problem with a fixed number of terminal pairs, which improves the running time from O(n^3) to O(n^2),where n is the number of the input graph. Furthermore, we gave a simpler and faster algorithm for some problems if the input graph is in restricted classes.