activity
20092026
most citedTheoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

97 citations · 433 across the 54 of their papers we have counts for

collaborators
Showing 2026 · cs.PLShow all

Nothing from them under that filter.

Their other years and fields are still on the left.