Author

Jiaqi Mao

h-index 0 View on Semantic Scholar

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.

Preprint Aug 2026

A simple and practical $o(\sqrt{n})$-time algorithm for shortest paths in power law graphs

PBS is proposed and analyzed, a simple sublinear approximation algorithm for power-law graphs with parameter $\beta\in[2,3)$ that does not require any preprocessing, yet exhibits performance comparable to light index-based algorithms (of linear or sublinear index size).

Jiaqi Mao · 0 citations