从不变量到并行经典化
From Invariants to Canonization in Parallel
摘要:
一个图的函数$f$称为完全图不变量,如果图$G$和$H$的同构等价于等式$f(G)=f(H)$ .此外,如果$f(G)$是一个与$G$同构的图,则$f$称为图的标准型。Gurevich证明了当图具有多项式时间可计算完全不变量时,图具有多项式时间可计算标准形。我们将这种等价性扩展到具有有界刚性指数的图类和具有小分隔符的图类的并行计算的多任务时间模型。特别是,我们的研究结果适用于三个有代表性的类图嵌入到一个固定的表面,即5-连通图,3-连通图承认多面体嵌入,3-连通图承认大边宽度嵌入。另一个应用包括具有有界树宽的图。由于在后一种情况下,NC完全不变的算法是已知的,我们得出结论,有界树宽的图形有一个标准的形式(甚至是一个标准的标签)可计算的NC。
英文摘要:
A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for graphs. Gurevich proves that graphs have a polynomial-time computable canonical form exactly when they have a polynomial-time computable complete invariant. We extend this equivalence to the polylogarithmic-time model of parallel computation for classes of graphs with bounded rigidity index and for classes of graphs with small separators. In particular, our results apply to three representative classes of graphs embeddable into a fixed surface, namely, to 5-connected graphs, to 3-connected graphs admitting a polyhedral embedding, and 3-connected graphs admitting a large-edge-width embedding. Another application covers graphs with bounded treewidth. Since in the latter case an NC complete-invariant algorithm is known, we conclude that graphs of bounded treewidth have a canonical form (and even a canonical labeling) computable in NC.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。