Conference
Jul 2026
On the Communication Complexity of Maximum Matching and Negative-Weight Shortest Paths
A new $\widetilde{O}(n^{3/2})$-bit protocol for computing a maximum matching in general graphs and a new $\widetilde{O}(n)$-bit protocol for negative-cycle detection and negative-weight single-source shortest paths are introduced.
Yu Cheng, Tianle Jiang, Pachara Sawettamalya et al.
· Embedded Systems and Applica... · 0 citations