Sign In

Login

Password

Forgot Password ? Sign Up

Euler tour technique (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Euler tour technique" in English language version.

refsWebsite
Global rank English rank
2doi.org
2nd place
2nd place
1psu.edu
207th place
136th place
1mit.edu
415th place
327th place

doi.org

  • Tarjan, R.E.; Vishkin, U. (1984). Finding biconnected components and computing tree functions in logarithmic parallel time. Proceedings of FOCS. pp. 12–20. CiteSeerX 10.1.1.419.3088. doi:10.1109/SFCS.1984q5896 (inactive 1 November 2024).{{cite conference}}: CS1 maint: DOI inactive as of November 2024 (link)
  • Henzinger, M. R.; King, V. (1995). "Randomized dynamic graph algorithms with polylogarithmic time per operation". Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95. p. 519. doi:10.1145/225058.225269. ISBN 0897917189.

mit.edu

courses.csail.mit.edu

  • Euler tour trees - in Lecture Notes in Advanced Data Structures. Prof. Erik Demaine; Scribe: Katherine Lai.

psu.edu

citeseerx.ist.psu.edu

  • Tarjan, R.E.; Vishkin, U. (1984). Finding biconnected components and computing tree functions in logarithmic parallel time. Proceedings of FOCS. pp. 12–20. CiteSeerX 10.1.1.419.3088. doi:10.1109/SFCS.1984q5896 (inactive 1 November 2024).{{cite conference}}: CS1 maint: DOI inactive as of November 2024 (link)