Parallel algorithms for depth-first searches I. Planar graphs
Journal Article
·
· SIAM J. Comput.; (United States)
This paper presents an unbounded-parallel algorithm for performing a depth-first search of a planar undirected graph. The algorithm uses O(n/sup 4/) processors and executes in O(log/sup 3/ n)-time. It had previously been conjectured that the problem of computing a depth-first spanning tree was inherently sequential.
- Research Organization:
- Dept. of Mathematics and Computer Science, Drexel Univ., Philadelphia, PA
- OSTI ID:
- 5441166
- Journal Information:
- SIAM J. Comput.; (United States), Journal Name: SIAM J. Comput.; (United States) Vol. 15:3; ISSN SMJCA
- Country of Publication:
- United States
- Language:
- English
Similar Records
A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs
Optimal graph algorithms on a fixed-size linear array
Parallel algorithms for problems involving directed graphs
Journal Article
·
Wed Jun 01 00:00:00 EDT 1988
· SIAM J. Comput.; (United States)
·
OSTI ID:6930310
Optimal graph algorithms on a fixed-size linear array
Journal Article
·
Tue Mar 31 23:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6626807
Parallel algorithms for problems involving directed graphs
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:7162931