Parallel depth-first search in general directed graphs

Authors:
A. Aggarwal;R. J. Anderson;M.-Y. Kao
Affiliations:
IBM Research Division, T.J. Watson Center, Box 218, Yorktown Heights, NY;Department, of Computer Science, University of Washington, Seattle, WA;Department of Computer Science, Indiana University, Bloomington, IN
Venue:
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Year:
1989

Citing 7
Cited 2

Parallel algorithms for depth-first searches I. planar graphs

SIAM Journal on Computing
Matrix multiplication via arithmetic progressions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion

Combinatorica
A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs

SIAM Journal on Computing
A parallel algorithm for the maximal path problem

Combinatorica - Theory of Computing
All graphs have cycle separators and planar directed depth-first search is in DNC (preliminary version)

VLSI Algorithms and Architectures
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Graph-theoretic methods in database theory

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A directed cycle separator of an n-vertex directed graph is a simple directed cycle such that when the vertices of the cycle are deleted, the resulting graph has no strongly connected component with more than n/2 vertices. This paper shows that the problem of finding a directed cycle separator is in randomized NC. The paper also proves that computing cycle separators and conducting depth-first search in directed graphs are deterministic NC-equivalent. These two results together yield the first RNC algorithm for depth-first search in directed graphs.