A fully dynamic algorithm for maintaining the transitive closure (Q5917499): Difference between revisions

@@ Property / cites work @@
+Size-estimation framework with applications to transitive closure and reachability
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+An On-Line Edge-Deletion Problem
@@ Property / cites work: An On-Line Edge-Deletion Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for fully dynamic connectivity problems in graphs
+Normal rank
@@ Property / cites work @@
+Q4252752
@@ Property / cites work: Q4252752 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542523
@@ Property / cites work: Q4542523 / rank @@
+Normal rank
@@ Property / cites work @@
+Sampling to provide or to bound: With applications to fully dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+Fast rectangular matrix multiplication and applications
+Normal rank
@@ Property / cites work @@
+On-line computation of transitive closures of graphs
+Normal rank
@@ Property / cites work @@
+Amortized efficiency of a path retrieval data structure
+Normal rank
@@ Property / cites work @@
+Finding paths and deleting edges in directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+On certificates and lookahead in dynamic graph problems
+Normal rank
@@ Property / cites work @@
+Complexity models for incremental computation
@@ Property / cites work: Complexity models for incremental computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3813313
@@ Property / cites work: Q3813313 / rank @@
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Speeding up dynamic transitive closure for bounded degree graphs
+Normal rank