journal article Jun 01, 1972

Depth-First Search and Linear Graph Algorithms

Topics

No keywords indexed for this article. Browse by subject →

References
8
[3]
GRAPH THEORY

Frank Harary

1969 10.21236/ad0705364
[5]
Hopcroft J. E. (1972)
[6]
Munro I. (1971)
[7]
Nilson N. J. (1971)
Cited By
4,499
International Journal of Heat and M...
RVSDG

Nico Reissmann, Jan Christian Meyer · 2020

ACM Transactions on Embedded Comput...
Metrics
4,499
Citations
8
References
Details
Published
Jun 01, 1972
Vol/Issue
1(2)
Pages
146-160
Cite This Article
Robert Tarjan (1972). Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing, 1(2), 146-160. https://doi.org/10.1137/0201010
Related

You May Also Like

The Knowledge Complexity of Interactive Proof Systems

Shafi Goldwasser, Silvio Micali · 1989

2,063 citations

Sparse Approximate Solutions to Linear Systems

B. K. Natarajan · 1995

1,969 citations

Fast Pattern Matching in Strings

Donald E. Knuth, James H. Morris, Jr. · 1977

1,950 citations

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

John E. Hopcroft, Richard M. Karp · 1973

1,891 citations