Abstract
We present the first parallel depth-first search algorithm for undirected graphs that has near-linear work and sublinear depth. Concretely, in any n-n......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
