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

计算无向图Tutte多项式的一种新的边选择启发式算法

A new edge selection heuristic for computing the Tutte polynomial of an undirected graph

Michael Monagan

摘要:

我们提出了一个新的边选择启发式和顶点排序启发式,一起使一个更大的稀疏图比以前做的Tutte多项式计算。作为一个具体的例子,我们能够使用我们的Maple实现在单个CPU上在4分钟内计算截断二十面体图的Tutte多项式。这与Haggard,Pearce和Royle最近的结果相比,他们的专用C++软件在150台计算机上花费了一周的时间。

英文摘要:

We present a new edge selection heuristic and vertex ordering heuristic that together enable one to compute the Tutte polynomial of much larger sparse graphs than was previously doable. As a specific example, we are able to compute the Tutte polynomial of the truncated icosahedron graph using our Maple implementation in under 4 minutes on a single CPU. This compares with a recent result of Haggard, Pearce and Royle whose special purpose C++ software took one week on 150 computers.

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

↑