A parallel algorithm for the maximal path problem

Authors:
Richard Anderson
Affiliations:
University of Washington, Seattle
Venue:
Combinatorica - Theory of Computing
Year:
1987

Citing 0
Cited 2

A random NC algorithm for depth first search

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel depth-first search in general directed graphs

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract