
Invited article on the Journal of ACM "Negative-Weight Single-Source Shortest Paths in Near-linear Time" presents a randomized algorithm that essentially resolves the classic negative-weight SSSP problem. #algorithm #graphalgorithm dl.acm.org/doi/10.1145/37…

English











