Semi-dynamic breadth-first search in digraphs (Q1589436): Difference between revisions

@@ Property / author @@
+Paolo Giulio Franciosa
@@ Property / author: Paolo Giulio Franciosa / rank @@
+Normal rank
@@ Property / author @@
+Daniele Frigioni
@@ Property / author: Daniele Frigioni / rank @@
+Normal rank
@@ Property / author @@
+Roberto Giaccio
@@ Property / author: Roberto Giaccio / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for the shortest path problem
@@ Property / cites work: Faster algorithms for the shortest path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230366
@@ Property / cites work: Q4230366 / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental algorithms for minimal length paths
@@ Property / cites work: Incremental algorithms for minimal length paths / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest path queries in digraphs of small treewidth
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3679232
@@ Property / cites work: Q3679232 / 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 @@
+Dynamic algorithms for shortest paths in planar graphs
+Normal rank
@@ Property / cites work @@
+Semi-dynamic breadth-first search in digraphs
@@ Property / cites work: Semi-dynamic breadth-first search in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The incremental maintenance of a depth-first-search tree in directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Semidynamic algorithms for maintaining single-source shortest path trees
+Normal rank
@@ Property / cites work @@
+Q4875188
@@ Property / cites work: Q4875188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252034
@@ Property / cites work: Q4252034 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252752
@@ Property / cites work: Q4252752 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385515
@@ Property / cites work: Q4385515 / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing breadth-first search trees in linear time
+Normal rank
@@ Property / cites work @@
+Maintaining a topological order under edge insertions
+Normal rank
@@ Property / cites work @@
+On the computational complexity of dynamic graph problems
+Normal rank
@@ Property / cites work @@
+Q3685214
@@ Property / cites work: Q3685214 / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized Computational Complexity
@@ Property / cites work: Amortized Computational Complexity / rank @@
+Normal rank