Negative-Weight Single-Source Shortest Paths in Near-Linear Time
The first combinatorial algorithm for negative-weight SSSP to break through the classic ˜O(m√n log W) bound.
Negative-Weight Single-Source Shortest Paths in Near-Linear Time
The first combinatorial algorithm for negative-weight SSSP to break through the classic ˜O(m√n log W) bound.
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved