The impact of dynamic events on the number of errors in networks

DOI10.1016/j.tcs.2016.02.012zbMath1338.68029OpenAlexW2285824978MaRDI QIDQ265066

Christian Glacet, David Ilcinkas, Nicolas Hanusse

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

zbMATH Keywords

networkerrorsgraphdynamicsdistance changesrouting information

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Unnamed Item
• \(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.
• Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
• 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

This page was built for publication: The impact of dynamic events on the number of errors in networks