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 33%
• Weighted Directed Graph 33%
• Shortest-path Tree 33%
• Dynamic Algorithms 33%
• Combinatorial Algorithms 33%
• Optimization Methods 33%
• Simple Graph 33%
• Graph Decomposition 33%
• Continuous Optimization 33%
• Near-Linear Time Algorithm 33%
• Negative Edges 33%

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 50%
• Shortest Path Tree 50%
• Shortest Path Problem 50%
• Continuous Optimization 50%
• Negative Edge Weight 50%