Skip to content

Author

Yu Cheng

We have 1 of 2 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.