图嵌入二维的单纯复形
Embedding graphs into two-dimensional simplicial complexes
摘要:
我们考虑一个输入图G是否允许拓扑嵌入到一个二维的【形】单纯复形C中的问题。这个问题包括图在曲面上的可嵌入性问题和图的拓扑交叉数,但更一般。当C是输入的一部分时,该问题是NP-完全的,并且当复数C是固定的时,我们给出了一个多项式时间算法。我们的策略是把这个问题归结为一个曲面上的嵌入扩张问题,它具有以下形式:给定一个图G '的子图H',以及H'在曲面S上的嵌入,该嵌入可以扩展到G'在S上的嵌入吗?这样的问题又可以使用Mohar算法中的关键组件来解决,以决定图在固定表面上的可嵌入性(STOC 1996,SIAM J. Discr. Math.1999)。
英文摘要:
We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the topological crossing number of a graph, but is more general. The problem is NP-complete when C is part of the input, and we give a polynomial-time algorithm if the complex C is fixed. Our strategy is to reduce the problem to an embedding extension problem on a surface, which has the following form: Given a subgraph H' of a graph G', and an embedding of H' on a surface S, can that embedding be extended to an embedding of G' on S? Such problems can be solved, in turn, using a key component in Mohar's algorithm to decide the embeddability of a graph on a fixed surface (STOC 1996, SIAM J. Discr. Math. 1999).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。