A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs
Journal Article
·
· SIAM J. Comput.; (United States)
This paper presents a parallel algorithm for constructing depth first spanning trees in planar graphs. The algorithm takes O(log/sup 2/n) time with O(n) processors on a concurrent read concurrent write parallel random access machine (PRAM). The best previously known algorithm for the problem takes O(log/sup 3/n) time with O(n/sup 4/) processors on a PRAM. The authors' algorithm is within an O(log/sup 2/n) factor of optimality.
- Research Organization:
- Dept. of Computer Science, State Univ. of New York, Buffalo, NY (US)
- OSTI ID:
- 6930310
- Journal Information:
- SIAM J. Comput.; (United States), Vol. 17:3
- Country of Publication:
- United States
- Language:
- English
Similar Records
NC algorithms for recognizing chordal graphs and k trees
Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees
Incremental graph algorithms for parallel random access machines
Journal Article
·
Sat Oct 01 00:00:00 EDT 1988
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6930310
Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:6930310
Incremental graph algorithms for parallel random access machines
Thesis/Dissertation
·
Wed Jan 01 00:00:00 EST 1986
·
OSTI ID:6930310