Dynamic Generators of Topologically Embedded Graphs
| dc.creator | Eppstein, David | |
| dc.date | 2002-07-24 | |
| dc.date.accessioned | 2026-07-07T03:18:43Z | |
| dc.date.available | 2026-07-07T03:18:43Z | |
| dc.description | 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. | |
| dc.description | 13 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0207082 | |
| dc.identifier | http://arxiv.org/abs/cs/0207082 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31231 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2 | |
| dc.title | Dynamic Generators of Topologically Embedded Graphs | |
| dc.type | text |