The impact of dynamic events on the number of errors in networks (Q265066): Difference between revisions

@@ Property / cites work @@
+A nearly optimal oracle for avoiding failed vertices and edges
+Normal rank
@@ Property / cites work @@
+\(f\)-sensitivity distance oracles and routing schemes
+Normal rank
@@ Property / cites work @@
+Diameter bounds for altered graphs
@@ Property / cites work: Diameter bounds for altered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to dynamic all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Oracles for Distances Avoiding a Failed Node or Link
+Normal rank
@@ Property / cites work @@
+Locating a target with an agent guided by unreliable local advice
+Normal rank
@@ Property / cites work @@
+Memoryless search algorithms in a network with faulty advice
+Normal rank
@@ Property / cites work @@
+Searching with mobile agents in networks with liars.
+Normal rank
@@ Property / cites work @@
+Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
+Normal rank
@@ Property / cites work @@
+Q2768399
@@ Property / cites work: Q2768399 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the most vital node of a shortest path.
@@ Property / cites work: Finding the most vital node of a shortest path. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3758865
@@ Property / cites work: Q3758865 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank