Depth-first search (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Depth-first search" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

3ams.org

451^st place

277^th place

3worldcat.org

5^th place

2books.google.com

3^rd place

2arxiv.org

69^th place

59^th place

111011110.github.io

low place

1cornell.edu

332^nd place

246^th place

1handle.net

102^nd place

76^th place

1harvard.edu

18^th place

17^th place

1mpg.de

1,624^th place

1,592^nd place

1web.archive.org

1^st place

1psu.edu

207^th place

136^th place

11011110.github.io

"Stack-based graph traversal ≠ depth first search". 11011110.github.io. Retrieved 2020-06-10.

ams.org

mathscinet.ams.org

Baccelli, Francois; Haji-Mirsadeghi, Mir-Omid; Khezeli, Ali (2018), "Eternal family trees and dynamics on unimodular random graphs", in Sobieczky, Florian (ed.), Unimodularity in Randomly Generated Graphs: AMS Special Session, October 8–9, 2016, Denver, Colorado, Contemporary Mathematics, vol. 719, Providence, Rhode Island: American Mathematical Society, pp. 85–127, arXiv:1608.05940, doi:10.1090/conm/719/14471, ISBN 978-1-4704-3914-9, MR 3880014, S2CID 119173820; see Example 3.7, p. 93
Aggarwal, A.; Anderson, R. J. (1988), "A random NC algorithm for depth first search", Combinatorica, 8 (1): 1–12, doi:10.1007/BF02122548, MR 0951989, S2CID 29440871.
Karger, David R.; Motwani, Rajeev (1997), "An NC algorithm for minimum cuts", SIAM Journal on Computing, 26 (1): 255–272, CiteSeerX 10.1.1.33.1701, doi:10.1137/S0097539794273083, MR 1431256.

arxiv.org

de Fraysseix, H.; Ossona de Mendez, P.; Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math.....10935D, doi:10.1142/S0129054106004248, S2CID 40107560.
Baccelli, Francois; Haji-Mirsadeghi, Mir-Omid; Khezeli, Ali (2018), "Eternal family trees and dynamics on unimodular random graphs", in Sobieczky, Florian (ed.), Unimodularity in Randomly Generated Graphs: AMS Special Session, October 8–9, 2016, Denver, Colorado, Contemporary Mathematics, vol. 719, Providence, Rhode Island: American Mathematical Society, pp. 85–127, arXiv:1608.05940, doi:10.1090/conm/719/14471, ISBN 978-1-4704-3914-9, MR 3880014, S2CID 119173820; see Example 3.7, p. 93

books.google.com

Even, Shimon (2011), Graph Algorithms (2nd ed.), Cambridge University Press, pp. 46–48, ISBN 978-0-521-73653-4.
Baccelli, Francois; Haji-Mirsadeghi, Mir-Omid; Khezeli, Ali (2018), "Eternal family trees and dynamics on unimodular random graphs", in Sobieczky, Florian (ed.), Unimodularity in Randomly Generated Graphs: AMS Special Session, October 8–9, 2016, Denver, Colorado, Contemporary Mathematics, vol. 719, Providence, Rhode Island: American Mathematical Society, pp. 85–127, arXiv:1608.05940, doi:10.1090/conm/719/14471, ISBN 978-1-4704-3914-9, MR 3880014, S2CID 119173820; see Example 3.7, p. 93

cornell.edu

ecommons.cornell.edu

Hopcroft, John; Tarjan, Robert E. (1974), "Efficient planarity testing" (PDF), Journal of the Association for Computing Machinery, 21 (4): 549–568, doi:10.1145/321850.321852, hdl:1813/6011, S2CID 6279825.

doi.org

Hopcroft, John; Tarjan, Robert E. (1974), "Efficient planarity testing" (PDF), Journal of the Association for Computing Machinery, 21 (4): 549–568, doi:10.1145/321850.321852, hdl:1813/6011, S2CID 6279825.
de Fraysseix, H.; Ossona de Mendez, P.; Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math.....10935D, doi:10.1142/S0129054106004248, S2CID 40107560.
Baccelli, Francois; Haji-Mirsadeghi, Mir-Omid; Khezeli, Ali (2018), "Eternal family trees and dynamics on unimodular random graphs", in Sobieczky, Florian (ed.), Unimodularity in Randomly Generated Graphs: AMS Special Session, October 8–9, 2016, Denver, Colorado, Contemporary Mathematics, vol. 719, Providence, Rhode Island: American Mathematical Society, pp. 85–127, arXiv:1608.05940, doi:10.1090/conm/719/14471, ISBN 978-1-4704-3914-9, MR 3880014, S2CID 119173820; see Example 3.7, p. 93
Reif, John H. (1985). "Depth-first search is inherently sequential". Information Processing Letters. 20 (5): 229–234. doi:10.1016/0020-0190(85)90024-9.
Aggarwal, A.; Anderson, R. J. (1988), "A random NC algorithm for depth first search", Combinatorica, 8 (1): 1–12, doi:10.1007/BF02122548, MR 0951989, S2CID 29440871.
Karger, David R.; Motwani, Rajeev (1997), "An NC algorithm for minimum cuts", SIAM Journal on Computing, 26 (1): 255–272, CiteSeerX 10.1.1.33.1701, doi:10.1137/S0097539794273083, MR 1431256.

handle.net

hdl.handle.net

Hopcroft, John; Tarjan, Robert E. (1974), "Efficient planarity testing" (PDF), Journal of the Association for Computing Machinery, 21 (4): 549–568, doi:10.1145/321850.321852, hdl:1813/6011, S2CID 6279825.

harvard.edu

ui.adsabs.harvard.edu

de Fraysseix, H.; Ossona de Mendez, P.; Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math.....10935D, doi:10.1142/S0129054106004248, S2CID 40107560.

mpg.de

people.mpi-inf.mpg.de

Mehlhorn, Kurt; Sanders, Peter (2008). Algorithms and Data Structures: The Basic Toolbox (PDF). Springer. Archived (PDF) from the original on 2015-09-08.

psu.edu

citeseerx.ist.psu.edu

Karger, David R.; Motwani, Rajeev (1997), "An NC algorithm for minimum cuts", SIAM Journal on Computing, 26 (1): 255–272, CiteSeerX 10.1.1.33.1701, doi:10.1137/S0097539794273083, MR 1431256.

semanticscholar.org

api.semanticscholar.org

Hopcroft, John; Tarjan, Robert E. (1974), "Efficient planarity testing" (PDF), Journal of the Association for Computing Machinery, 21 (4): 549–568, doi:10.1145/321850.321852, hdl:1813/6011, S2CID 6279825.
de Fraysseix, H.; Ossona de Mendez, P.; Rosenstiehl, P. (2006), "Trémaux Trees and Planarity", International Journal of Foundations of Computer Science, 17 (5): 1017–1030, arXiv:math/0610935, Bibcode:2006math.....10935D, doi:10.1142/S0129054106004248, S2CID 40107560.
Baccelli, Francois; Haji-Mirsadeghi, Mir-Omid; Khezeli, Ali (2018), "Eternal family trees and dynamics on unimodular random graphs", in Sobieczky, Florian (ed.), Unimodularity in Randomly Generated Graphs: AMS Special Session, October 8–9, 2016, Denver, Colorado, Contemporary Mathematics, vol. 719, Providence, Rhode Island: American Mathematical Society, pp. 85–127, arXiv:1608.05940, doi:10.1090/conm/719/14471, ISBN 978-1-4704-3914-9, MR 3880014, S2CID 119173820; see Example 3.7, p. 93
Aggarwal, A.; Anderson, R. J. (1988), "A random NC algorithm for depth first search", Combinatorica, 8 (1): 1–12, doi:10.1007/BF02122548, MR 0951989, S2CID 29440871.

web.archive.org

Mehlhorn, Kurt; Sanders, Peter (2008). Algorithms and Data Structures: The Basic Toolbox (PDF). Springer. Archived (PDF) from the original on 2015-09-08.

worldcat.org

Charles Pierre Trémaux (1859–1882) École polytechnique of Paris (X:1876), French engineer of the telegraph
in Public conference, December 2, 2010 – by professor Jean Pelletier-Thibert in Académie de Macon (Burgundy – France) – (Abstract published in the Annals academic, March 2011 – ISSN 0980-6032)
Sedgewick, Robert (2010). Algorithms in Java. Addison-Wesley. ISBN 978-0-201-36121-6. OCLC 837386973.

search.worldcat.org

Sedgewick, Robert (2010). Algorithms in Java. Addison-Wesley. ISBN 978-0-201-36121-6. OCLC 837386973.