A dynamic topological sort algorithm for directed acyclic graphs (Q3507767): Difference between revisions

@@ Property / cites work @@
+A random graph model for massive graphs
@@ Property / cites work: A random graph model for massive graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
+Normal rank
@@ Property / cites work @@
+Q3138876
@@ Property / cites work: Q3138876 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
+Normal rank
@@ Property / cites work @@
+Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Q4411355
@@ Property / cites work: Q4411355 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic shortest paths in digraphs with arbitrary arc weights
+Normal rank
@@ Property / cites work @@
+Improved algorithms for dynamic shortest paths
@@ Property / cites work: Improved algorithms for dynamic shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4470497
@@ Property / cites work: Q4470497 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252034
@@ Property / cites work: Q4252034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4438019
@@ Property / cites work: Q4438019 / rank @@
+Normal rank
@@ Property / cites work @@
+Separator based sparsification for dynamic planar graph algorithms
+Normal rank
@@ Property / cites work @@
+Q4519896
@@ Property / cites work: Q4519896 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921699
@@ Property / cites work: Q2921699 / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining longest paths incrementally
@@ Property / cites work: Maintaining longest paths incrementally / rank @@
+Normal rank
@@ Property / cites work @@
+A fully dynamic algorithm for maintaining the transitive closure
+Normal rank
@@ Property / cites work @@
+Maintaining a topological order under edge insertions
+Normal rank
@@ Property / cites work @@
+Random Generation of Directed Acyclic Graphs
@@ Property / cites work: Random Generation of Directed Acyclic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2712580
@@ Property / cites work: Q2712580 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded incremental computation
@@ Property / cites work: Bounded incremental computation / rank @@
+Normal rank
@@ Property / cites work @@
+On competitive on-line algorithms for the dynamic priority-ordering problem
+Normal rank
@@ Property / cites work @@
+On the computational complexity of dynamic graph problems
+Normal rank
@@ Property / cites work @@
+On incremental evaluation of ordered attributed grammars
+Normal rank
@@ Property / cites work @@
+Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
+Normal rank