arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0207082cs.DS
收藏

拓扑嵌入图的动态生成元

Dynamic Generators of Topologically Embedded Graphs

David Eppstein

摘要:

我们提供了一种数据结构,用于维护图在表面上的嵌入(由每个顶点周围的边的排列组合地表示)和计算表面的基本群的生成元,在摊销时间O(log n + log g(log log g)^3)在亏格g的曲面上每次更新;我们还可以在同一时间内测试曲面的可定向性,并在每次更新的O(log n + log^4 g)时间内维护图的最小和最大生成树。我们的数据结构允许边插入和删除以及双重操作;这些操作可能会隐含地改变嵌入表面的亏格。我们应用类似的思想来改进低亏格图的分离器定理中的常数因子,并在线性时间内找到低亏格低直径图的树分解。

英文摘要:

We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators of the fundamental group of the surface, in amortized time O(log n + log g(log log g)^3) per update on a surface of genus g; we can also test orientability of the surface in the same time, and maintain the minimum and maximum spanning tree of the graph in time O(log n + log^4 g) per update. Our data structure allows edge insertion and deletion as well as the dual operations; these operations may implicitly change the genus of the embedding surface. We apply similar ideas to improve the constant factor in a separator theorem for low-genus graphs, and to find in linear time a tree-decomposition of low-genus low-diameter graphs.

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

↑