Sign In

Login

Password

Forgot Password ? Sign Up

Graphe connexe (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graphe connexe" in French language version.

refsWebsite
Global rank French rank
3doi.org
2nd place
3rd place
1files.wordpress.com
869th place
832nd place
1issn.org
57th place
4th place
1sciencedirect.com
149th place
80th place

doi.org

dx.doi.org

  • Romas Aleliunas, Richard M. Karp, Richard J. Lipton et Laszlo Lovasz, « Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems », Proceedings of the 20th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, sFCS '79,‎ , p. 218–223 (DOI 10.1109/SFCS.1979.34, lire en ligne, consulté le )
  • Stephen A Cook et Pierre McKenzie, « Problems complete for deterministic logarithmic space », Journal of Algorithms, vol. 8, no 3,‎ , p. 385–394 (ISSN 0196-6774, DOI 10.1016/0196-6774(87)90018-6, lire en ligne, consulté le )

doi.org

  • Romas Aleliunas, Richard M. Karp, Richard J. Lipton et Laszlo Lovasz, « Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems », Proceedings of the 20th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, sFCS '79,‎ , p. 218–223 (DOI 10.1109/SFCS.1979.34, lire en ligne, consulté le )

files.wordpress.com

omereingold.files.wordpress.com

  • Omer Reingold, « Undirected connectivity in log-space », Journal of the ACM, vol. 55, no 4,‎ , p. 1–24 (lire en ligne)

issn.org

portal.issn.org

sciencedirect.com