Negative-Weight Single-Source Shortest Paths in Near-linear Time

Keyphrases

• Near-linear Time 100%
• Single-source Shortest Paths 100%
• Negative Weight 100%
• Edge Weight 25%
• Randomized Algorithms 25%
• Directed Graph 25%
• Dynamic Algorithms 25%
• Combinatorial Algorithms 25%
• Optimization Methods 25%
• Simple Graph 25%
• Graph Decomposition 25%
• Continuous Optimization 25%
• Near-Linear Time Algorithm 25%

Mathematics

• Linear Time 100%
• Edge 50%
• Dynamic Algorithms 50%
• Combinatorial Algorithm 50%
• Path Problem 50%
• Simple Graph 50%

Computer Science

• Negative Weight 100%
• Directed Graphs 33%
• Randomized Algorithm 33%
• Shortest Path Problem 33%
• Continuous Optimization 33%