About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Combinatorica
Paper
A random 1-011-011-01algorithm for depth first search
Abstract
In this paper we present a fast parallel algorithm for constructing a depth first search tree for an undirected graph. The algorithm is an RNC algorithm, meaning that it is a probabilistic algorithm that runs in polylog time using a polynomial number of processors on a P-RAM. The run time of the algorithm is O(TMM(n) log3n), and the number of processors used is PMM (n) where TMM(n) and PMM(n) are the time and number of processors needed to find a minimum weight perfect matching on an n vertex graph with maximum edge weight n. © 1988 Akadémiai Kiadó.