有界亏格图中分离子的时空优化算法
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs
摘要：
图分隔符是图的顶点的子集，其移除将图划分为小组件。计算各类图的小图分隔符是一项重要的计算任务。在本文中，我们提出了一个多项式时间算法，使用$O(g^{1/2}n^{1/2}\log n)$ -空间找到一个$O(g^{1/2}n^{1/2})$大小的分离器的图有$n$顶点和嵌入的表面上的亏格$g$。
英文摘要：
A graph separator is a subset of vertices of a graph whose removal divides the graph into small components. Computing small graph separators for various classes of graphs is an important computational task. In this paper, we present a polynomial time algorithm that uses $O(g^{1/2}n^{1/2}\log n)$-space to find an $O(g^{1/2}n^{1/2})$-sized separator of a graph having $n$ vertices and embedded on a surface of genus $g$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
