Dynamic Plane Transitive Closure

Download PDF
Open Webpage

Krzysztof Diks, Piotr Sankowski

Published: 2007, Last Modified: 18 Jun 2024ESA 2007EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this paper we study the problem of transitive closure in dynamic directed plane graphs. We show a dynamic algorithm supporting updates and queries in worst-case \(\tilde{O}(\sqrt{n})\) time. This is the first known algorithm for this problem with almost linear update time and query time product.