站点图的标准标号
Canonical Labelling of Site Graphs
摘要：
我们调查算法的规范标签的网站图，即图中的边缘绑定顶点的网站与当地唯一的名称。我们首先表明，网站图的标准标签的问题减少到标准标签的边着色图的问题。然后，我们提出了两个典型的标签算法的基础上边枚举，和第三个扩展的Hopcroft的分区细化算法的基础上。所有产品均在二次最差情况时间内单独运行。然而，其中一个边枚举算法运行在次二次时间的图与“许多”自同构，分区细化算法运行在次二次时间的图与“很少”互模拟等价。这套算法是基于图属于这两类之一的期望而选择的。如果是这种情况，则组合算法在次二次最坏情况时间内运行。这种期望是否合理仍然是一个有趣的悬而未决的问题。
英文摘要：
We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
