Parallel Algorithms for Depth-First Search

In this paper we examine parallel algorithms for performing a depth-first search (DFS) of a directed or undirected graph in sub-linear time. this subject is interesting in part because DFS seemed at first to be an inherently sequential process, and for a long time many researchers believed that no such algorithms existed. We survey three seminal papers on the subject. The first one proves that a special case of DFS is (in all likelihood) inherently sequential; the second shows that DFS for planar undirected graphs is in NC; and the third shows that DFS for general undirected graphs is in RNC. We also discuss randomnized algorithms, Pcompleteness and matching, three topics that are essential for understanding and appreciating the results in these papers. Disciplines Theory and Algorithms Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-91-71. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/428 Parallel Algorithms For Depth-First Search MS-CIS-91-71

[1]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[2]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[3]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[4]  Shimon Even,et al.  An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[5]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[6]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[7]  Derek G. Corneil,et al.  Parallel computations in graph theory , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[8]  Robert E. Tarjan,et al.  Almost-optimum speed-ups of algorithms for bipartite matching and related problems , 1988, STOC '88.

[9]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[10]  Gary L. Miller,et al.  Riemann's Hypothesis and tests for primality , 1975, STOC.

[11]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.

[12]  Sanguthevar Rajasekaran,et al.  Ranomized Parallel Computation , 1987, FCT.

[13]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[14]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[15]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[16]  Leonard M. Adleman,et al.  Reducibility, randomness, and intractibility (Abstract) , 1977, STOC '77.

[17]  D. Bernstein.  DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS , 2022 .

[18]  Richard Anderson.  A parallel algorithm for the maximal path problem , 1985, STOC '85.

[19]  Larry J. Stockmeyer,et al.  A characterization of the power of vector machines , 1974, STOC '74.

[20]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[21]  Victor Y. Pan,et al.  Improved processor bounds for combinatorial problems in RNC , 1988, Comb..

[22]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[23]  Robert E. Tarjan,et al.  Finding Dominators in Directed Graphs , 1974, SIAM J. Comput..

[24]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[25]  Justin R. Smith.  Parallel Algorithms for Depth-First Searches I. Planar Graphs , 1986, SIAM J. Comput..

[26]  Ming-Yang Kao,et al.  All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC , 1988, AWOC.

[27]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[28]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[29]  John H. Reif,et al.  Depth-First Search is Inherently Sequential , 1985, Inf. Process. Lett..

[30]  Larry J. Stockmeyer,et al.  A Characterization of the Power of Vector Machines , 1976, J. Comput. Syst. Sci..

[31]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[32]  Andrew V. Goldberg,et al.  Interior-point methods in parallel computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

[33]  Alok Aggarwal,et al.  A random NC algorithm for depth first search , 1987, Comb..

[34]  John H. Reif.  On Synchronous Parallel Computations with Independent Probabilistic Choice , 1984, SIAM J. Comput..

[35]  Francis Y. L. Chin,et al.  OPTIMAL PARALLEL ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEM. , 1981 .

[36]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[37]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[38]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[39]  A. Aggarwal,et al.  Parallel depth-first search in general directed graphs , 1989, STOC '89.

[40]  Denise Marie Eckstein.  Parallel graph processing using depth-first search and breadth-first search. , 1977 .

[41]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[42]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[43]  Joseph JáJá,et al.  Parallel Algorithms in Graph Theory: Planarity Testing , 1982, SIAM J. Comput..

[44]  Nicholas Pippenger,et al.  On Simultaneous Resource Bounds (Preliminary Version) , 1979, FOCS 1979.

[45]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[46]  Torben Hagerup,et al.  Planar Depth-First Search in O(log n) Parallel Time , 1990, SIAM J. Comput..

[47]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[48]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[49]  John Staples,et al.  The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..

[50]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[51]  Andrew V. Goldberg,et al.  Sublinear-time parallel algorithms for matching and related problems , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[52]  G. P. Bhattacharjee,et al.  A parallel search algorithm for directed acyclic graphs , 1984, BIT.