Dynamic plane transitive closure

Authors:
Krzysztof Diks;Piotr Sankowski
Affiliations:
Institute of Informatics, Warsaw University, Warsaw, Poland;Institute of Informatics, Warsaw University, Warsaw, Poland and Dipartimento di Informatica e Sistemistica, University of Rome "La Sapienza", Rome, Italy
Venue:
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Year:
2007

Citing 17
Cited 3

Separator based sparsification for dynamic planar graph algorithms

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A fully dynamic algorithm for maintaining the transitive closure

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On certificates and lookahead in dynamic graph problems

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A faster and simpler fully dynamic transitive closure

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Dynamic Reachability Algorithms for Directed Graphs

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
A Fully Dynamic Data Structure for Reachability in Planar Digraphs

ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Fully dynamic biconnectivity and transitive closure

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Finding small simple cycle separators for 2-connected planar graphs.

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A fully dynamic reachability algorithm for directed graphs with an almost linear update time

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Compact oracles for reachability and approximate distances in planar digraphs

Journal of the ACM (JACM)
Fast sparse matrix multiplication

ACM Transactions on Algorithms (TALG)
Planar graphs, negative weight edges, shortest paths, and near linear time

Journal of Computer and System Sciences - Special issue on FOCS 2001

Algebraic Graph Algorithms

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Improved deterministic algorithms for decremental transitive closure and strongly connected components

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components

ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11

Quantified Score

Hi-index	0.00

Visualization

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 Õ(√n) time. This is the first known algorithm for this problem with almost linear update time and query time product.