A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time (Q2810272): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Nearest common ancestors: a survey and a new algorithm for a distributed environment
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / rank @@
+Normal rank
@@ Property / cites work @@
+Lowest common ancestors in trees and directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Maintaining shortest paths under deletions in weighted directed graphs
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Trade-offs for fully dynamic transitive closure on DAGs: breaking through the             <i>O</i>             (             <i>n</i>             <sup>2</sup>             barrier
+Normal rank
@@ Property / cites work @@
+An Experimental Study of Dynamic Algorithms for Transitive Closure
+Normal rank
@@ Property / cites work @@
+Path-based depth-first search for strong and biconnected components
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Q4252752
@@ Property / cites work: Q4252752 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
+Normal rank
@@ Property / cites work @@
+Finding paths and deleting edges in directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Dynamic graph connectivity in polylogarithmic worst case time
+Normal rank
@@ Property / cites work @@
+An experimental study of algorithms for fully dynamic transitive closure
+Normal rank
@@ Property / cites work @@
+Q5365129
@@ Property / cites work: Q5365129 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability in graph timelines
@@ Property / cites work: Reachability in graph timelines / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471323
@@ Property / cites work: Q4471323 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Dynamic Reachability Algorithms for Directed Graphs
+Normal rank
@@ Property / cites work @@
+A fully dynamic reachability algorithm for directed graphs with an almost linear update time
+Normal rank
@@ Property / cites work @@
+On Finding Lowest Common Ancestors: Simplification and Parallelization
+Normal rank
@@ Property / cites work @@
+A strong-connectivity algorithm and its applications in data flow analysis
+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 @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/13093618x
@@ Property / full work available at URL: https://doi.org/10.1137/13093618x / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2401697020
@@ Property / OpenAlex ID: W2401697020 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2810272