Q5091049 (Q5091049): Difference between revisions

@@ Property / cites work @@
+On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
+Normal rank
@@ Property / cites work @@
+On the solution of linear recurrence equations
@@ Property / cites work: On the solution of linear recurrence equations / rank @@
+Normal rank
@@ Property / cites work @@
+Planar spanners and approximate shortest path queries among obstacles in the plane
+Normal rank
@@ Property / cites work @@
+Calculating bounds on reachability and connectedness in stochastic networks
+Normal rank
@@ Property / cites work @@
+Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Many distances in planar graphs
@@ Property / cites work: Many distances in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Counting and sampling minimum cuts in genus \(g\) graphs
+Normal rank
@@ Property / cites work @@
+Shortest path queries in planar graphs
@@ Property / cites work: Shortest path queries in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs, negative weight edges, shortest paths, and near linear time
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607915
@@ Property / cites work: Q4607915 / rank @@
+Normal rank
@@ Property / cites work @@
+A separator theorem for graphs of bounded genus
@@ Property / cites work: A separator theorem for graphs of bounded genus / 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 @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximately counting approximately-shortest paths in directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Q5743390
@@ Property / cites work: Q5743390 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Approximately counting paths and cycles in a graph
+Normal rank