Tarjan's strongly connected components algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Tarjan's strongly connected components algorithm" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

1web.archive.org

1^st place

1^st place

207^th place

136^th place

1,564^th place

1,028^th place

low place

low place

887^th place

714^th place

1logarithmic.net

low place

low place

low place

7,385^th place

caltech.edu

courses.cms.caltech.edu

"Lecture 19: Tarjan's Algorithm for Identifying Strongly Connected Components in the Dependency Graph" (PDF), CS130 Software Engineering, Caltech, Winter 2024

cmu.edu

cs.cmu.edu

"Lecture #19: Depth First Search and Strong Components" (PDF), 15-451/651: Design & Analysis of Algorithms, Carnegie Mellon, 1 November 2018

doi.org

Tarjan, R. E. (1972), "Depth-first search and linear graph algorithms" (PDF), SIAM Journal on Computing, 1 (2): 146–160, CiteSeerX 10.1.1.327.8418, doi:10.1137/0201010
Kordy, Piotr; Langerak, Rom; Mauw, Sjouke; Polderman, Jan Willem (2014), "A symbolic algorithm for the analysis of robust timed automata" (PDF), in Jones, Cliff B.; Pihlajasaari, Pekka; Sun, Jun (eds.), FM 2014: Formal Methods – 19th International Symposium, Singapore, May 12–16, 2014. Proceedings, Lecture Notes in Computer Science, vol. 8442, Springer, pp. 351–366, doi:10.1007/978-3-319-06410-9_25, ISBN 978-3-319-06409-3
Nuutila, Esko (1994), "On Finding the Strongly Connected Components in a Directed Graph", Information Processing Letters, 49 (1): 9–14, doi:10.1016/0020-0190(94)90047-7
Pearce, David, "A Space Efficient Algorithm for Detecting Strongly Connected Components", Information Processing Letters, 116 (1): 47–52, doi:10.1016/j.ipl.2015.08.010

informit.com

Knuth, Donald (2014-05-20), Twenty Questions for Donald Knuth

logarithmic.net

Harrison, Paul, "Robust topological sorting and Tarjan's algorithm in Python", retrieved 9 February 2011

psu.edu

citeseerx.ist.psu.edu

Tarjan, R. E. (1972), "Depth-first search and linear graph algorithms" (PDF), SIAM Journal on Computing, 1 (2): 146–160, CiteSeerX 10.1.1.327.8418, doi:10.1137/0201010

uni.lu

satoss.uni.lu

Kordy, Piotr; Langerak, Rom; Mauw, Sjouke; Polderman, Jan Willem (2014), "A symbolic algorithm for the analysis of robust timed automata" (PDF), in Jones, Cliff B.; Pihlajasaari, Pekka; Sun, Jun (eds.), FM 2014: Formal Methods – 19th International Symposium, Singapore, May 12–16, 2014. Proceedings, Lecture Notes in Computer Science, vol. 8442, Springer, pp. 351–366, doi:10.1007/978-3-319-06410-9_25, ISBN 978-3-319-06409-3

web.archive.org

Tarjan, R. E. (1972), "Depth-first search and linear graph algorithms" (PDF), SIAM Journal on Computing, 1 (2): 146–160, CiteSeerX 10.1.1.327.8418, doi:10.1137/0201010