arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.3774math.COcs.DMcs.DS
收藏

正则图覆盖的数学性质及其在可平面图中的应用

Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs

Jiří Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela

摘要:

图$G$覆盖图$H$,如果存在从$G$到$H$的局部双射同态。我们处理的正规覆盖,其中这局部双射同态规定的行动的一个子群的${\rm Aut}(G)$。正则复盖在数学和计算机科学中的大对象的构造和研究中有着广泛的应用。我们研究计算方面的定期覆盖,以前没有得到解决。判定问题RegularCover要求两个给定的图$G$和$H$是否$G$定期覆盖$H$。当$|H|=1$,这个问题成为凯莱图识别的复杂性仍然没有得到解决。当$|G| = |H|$成为图同构问题时,另一种特殊情况出现。因此,我们限制自己的图类多项式可解图同构。受Negami的启发,我们应用Babai在20世纪70年代使用的结构结果来研究图的自同构群。我们的主要结果是下面的FPT元算法:设$\cal C$是一类图,使得$\cal C$中的3-连通图的自同构群的结构是简单的。然后,我们可以在时间$O^*(2^{e(H)/2})$中求解$\cal C$ -输入$G$的正则覆盖,其中$e(H)$表示$H$的边的数目。作为$\cal C$的一个示例,该元算法适用于可平面图。相比之下,已知测试一般图覆盖对于平面输入$G$是NP完全的,即使对于诸如$K_4$或$K_5$的小的固定图$H$也是NP完全的。我们的大部分结果也适用于一般的图,特别是完整的结构理解的定期覆盖2-割。

英文摘要:

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular covers have many applications in constructions and studies of big objects all over mathematics and computer science. We study computational aspects of regular covers that have not been addressed before. The decision problem RegularCover asks for two given graphs $G$ and $H$ whether $G$ regularly covers $H$. When $|H|=1$, this problem becomes Cayley graph recognition for which the complexity is still unresolved. Another special case arises for $|G| = |H|$ when it becomes the graph isomorphism problem. Therefore, we restrict ourselves to graph classes with polynomially solvable graph isomorphism. Inspired by Negami, we apply the structural results used by Babai in the 1970's to study automorphism groups of graphs. Our main result is the following FPT meta-algorithm: Let $\cal C$ be a class of graphs such that the structure of automorphism groups of 3-connected graphs in $\cal C$ is simple. Then we can solve RegularCover for $\cal C$-inputs $G$ in time $O^*(2^{e(H)/2})$ where $e(H)$ denotes the number of the edges of $H$. As one example of $\cal C$, this meta-algorithm applies to planar graphs. In comparison, testing general graph covers is known to be NP-complete for planar inputs $G$ even for small fixed graphs $H$ such as $K_4$ or $K_5$. Most of our results also apply to general graphs, in particular the complete structural understanding of regular covers for 2-cuts.

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

↑