The impact of dynamic events on the number of errors in networks
From MaRDI portal
Publication:265066
DOI10.1016/j.tcs.2016.02.012zbMath1338.68029MaRDI QIDQ265066
Christian Glacet, Nicolas Hanusse, David Ilcinkas
Publication date: 1 April 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.012
68R10: Graph theory (including graph drawing) in computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
Cites Work
- \(f\)-sensitivity distance oracles and routing schemes
- Memoryless search algorithms in a network with faulty advice
- Finding the most vital node of a shortest path.
- Searching with mobile agents in networks with liars.
- Oracles for Distances Avoiding a Failed Node or Link
- A nearly optimal oracle for avoiding failed vertices and edges
- Locating a target with an agent guided by unreliable local advice
- Diameter bounds for altered graphs
- Algorithm Theory - SWAT 2004
- A new approach to dynamic all pairs shortest paths
- Unnamed Item
- Unnamed Item
- Unnamed Item