A random 1-011-011-01algorithm for depth first search |
| |
| Authors: | A Aggarwal R J Anderson |
| |
| Institution: | (1) IBM T. J. Watson Center, P. O. Box 218, 10598 Yorktown Heights, New York, USA;(2) Dept. of Computer Science, FR-35, University of Washington, 98195 Seattle, Washington, USA |
| |
| Abstract: | In this paper we present a fast parallel algorithm for constructing a depth first search tree for an undirected graph. The algorithm is anRNC algorithm, meaning that it is a probabilistic algorithm that runs in polylog time using a polynomial number of processors on aP-RAM. The run time of the algorithm isO(T
MM(n) log3
n), and the number of processors used isP
MM (n) whereT
MM(n) andP
MM(n) are the time and number of processors needed to find a minimum weight perfect matching on ann vertex graph with maximum edge weightn.This research was done while the first author was visiting the Mathematical Research Institute in Berkeley. Research supported in part by NSF grant 8120790.Supported by Air Force Grant AFOSR-85-0203A. |
| |
| Keywords: | 68 Q 10 05 C 99 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
