Parallel depth-first search in general directed graphs

On randomization in sequential and distributed algorithms

ACM Computing Surveys (CSUR)

Using tadpoles to reduce memory and communication requirements for exhaustive, breadth-first search using distributed computers

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures

Time-work tradeoffs for parallel algorithms

Journal of the ACM (JACM)

Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel

IEEE Transactions on Parallel and Distributed Systems

On Identifying Strongly Connected Components in Parallel

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing

Finding strongly connected components in parallel using O(log2n) reachability queries

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures