Depth-first search is inherently sequential
- 1 June 1985
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 20 (5), 229-234
- https://doi.org/10.1016/0020-0190(85)90024-9
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The maximum flow problem is log space complete for PTheoretical Computer Science, 1982
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- Efficient Planarity TestingJournal of the ACM, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973