论文标题
用于计算属的实用算法
A Practical Algorithm for the Computation of the Genus
论文作者
论文摘要
我们描述了一种实用算法来计算图的（定向）属，给出实现该算法的程序的结果，并将性能与现有算法进行比较。该算法的目的是足够快地用于许多应用，而不是专注于理论渐近复杂性。除了具体问题和结果外，本文还可以将其视为一个示例，其中一些用于仔细开发和实施标准回溯算法的设计原理仍然可以导致非常具竞争力的计划。
We describe a practical algorithm to compute the (oriented) genus of a graph, give results of the program implementing this algorithm, and compare the performance to existing algorithms. The aim of this algorithm is to be fast enough for many applications instead of focusing on the theoretical asymptotic complexity. Apart from the specific problem and the results, the article can also be seen as an example how some design principles used to carefully develop and implement standard backtracking algorithms can still result in very competitive programs.
