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

Journal Article · Wed Jun 01 00:00:00 EDT 1988 · SIAM J. Comput.; (United States)

DOI:https://doi.org/10.1137/0217028· OSTI ID:6930310

He, X; Yesha, Y

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), Journal Name: SIAM J. Comput.; (United States) Vol. 17:3; ISSN SMJCA
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
GRAPHS
MATHEMATICAL LOGIC
MEASURING METHODS
PARALLEL PROCESSING
PROGRAMMING
RANDOMNESS