论文标题
时间空间最佳算法用于计算有限属图中的分离器
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs
论文作者
论文摘要
图形分离器是图的顶点的子集，其去除将图分为小组件。为各类图的计算小图分离器是一项重要的计算任务。 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$.
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$.
