A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs (Q5060135): Difference between revisions

@@ Property / cites work @@
+Q3138872
@@ Property / cites work: Q3138872 / rank @@
+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 @@
+Q4036575
@@ Property / cites work: Q4036575 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3679232
@@ Property / cites work: Q3679232 / rank @@
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Q4694731
@@ Property / cites work: Q4694731 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036576
@@ Property / cites work: Q4036576 / 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 @@
+Finding small simple cycle separators for 2-connected planar graphs
+Normal rank