Depth-First Search is Inherently Sequential

[1]  Patrick W. Dymond,et al.  Speedups of deterministic machines by synchronous parallel machines , 1983, J. Comput. Syst. Sci..

[2]  Mikhail J. Atallah,et al.  Graph Problems on a Mesh-Connected Processor Array , 1984, JACM.

[3]  John H. Reif,et al.  Symmetric Complementation , 1984, JACM.

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

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

[6]  John H. Reif,et al.  On the Power of Probabilistic Choice in Synchronous Parallel Computations , 1982, ICALP.

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

[8]  Joseph JáJá,et al.  Fast, Efficient Parallel Algorithms for Some Graph Problems , 1981, SIAM J. Comput..

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

[10]  Richard J. Lipton,et al.  Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

[11]  James Christopher Wyllie,et al.  The Complexity of Parallel Computations , 1979 .

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

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

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

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

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

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

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

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

[20]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[21]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

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

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

[24]  J. Hopcroft,et al.  Efficient algorithms for graph manipulation , 1971 .