Deterministic decremental single source shortest paths: Beyond the O(mn) bound

Keyphrases

• Decremental 100%
• Update Time 100%
• Single-source Shortest Paths 100%
• Adversary 40%
• Shortest Path 40%
• Undirected Graph 40%
• Edge Deletion 40%
• Unweighted Graph 40%
• Approximation Algorithms 20%
• Query Response Time 20%
• Randomized Algorithms 20%
• N 2O 20%
• Exact Solutions 20%
• Shortest-path Tree 20%
• Bernstein 20%
• Source Node 20%
• Shortest Path Algorithm 20%
• Randomized Setting 20%
• First Improvement 20%
• Dense Instances 20%
• Approximate Shortest Paths 20%

Computer Science

• Directed Graphs 100%
• Shortest Path Problem 100%
• Randomized Algorithm 50%
• Shortest Path Tree 50%
• Approximate Algorithm 50%
• Shortest Path Algorithm 50%

Mathematics

• Approximates 100%
• Edge 75%
• Path Problem 50%
• Open Problem 25%
• Source Node 25%