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

@@ Property / Mathematics Subject Classification ID @@
+M15
@@ Property / Mathematics Subject Classification ID: 68M15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6561938
@@ Property / zbMATH DE Number: 6561938 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph
@@ Property / zbMATH Keywords: graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+network
@@ Property / zbMATH Keywords: network / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dynamics
@@ Property / zbMATH Keywords: dynamics / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+errors
@@ Property / zbMATH Keywords: errors / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+routing information
@@ Property / zbMATH Keywords: routing information / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+distance changes
@@ Property / zbMATH Keywords: distance changes / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.02.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2285824978
@@ Property / OpenAlex ID: W2285824978 / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:265066