Floyd–Warshall-algoritmus (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Floyd–Warshall-algoritmus" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

2^nd place

8^th place

124^th place

33^rd place

1^st place

580^th place

467^th place

low place

3^rd place

28^th place

berkeley.edu

Hochbaum: Section 8.9: Floyd-Warshall algorithm for all pairs shortest paths (PDF). Lecture Notes for IEOR 266: Graph Algorithms and Network Flows. Department of Industrial Engineering and Operations Research, University of California, Berkeley, 2014 [2016. október 20-i dátummal az eredetiből archiválva]. (Hozzáférés: 2020. június 11.)

Roy (1959). „Transitivité et connexité.” (french nyelven). C. R. Acad. Sci. Paris 249, 216–218. o.

Gross, Jonathan L. & Yellen, Jay (2003), Handbook of Graph Theory, Discrete Mathematics and Its Applications, CRC Press, p. 65, ISBN 9780203490204, <https://books.google.com/books?id=mKkIGIea_BkC&pg=PA65>.

Floyd (1962. június 1.). „Algorithm 97: Shortest Path”. Communications of the ACM 5 (6), 345. o. DOI:10.1145/367766.368168.
Warshall (1962. január 1.). „A theorem on Boolean matrices”. Journal of the ACM 9 (1), 11–12. o. DOI:10.1145/321105.321107.
Ingerman (1962. november 1.). „Algorithm 141: Path Matrix”. Communications of the ACM 5, 556. o. DOI:10.1145/368996.369016.
Stefan Hougardy (2010. április 1.). „The Floyd–Warshall algorithm on graphs with negative cycles”. Information Processing Letters 110, 279–281. o. DOI:10.1016/j.ipl.2010.02.001.
Zwick, Uri (May 2002), "All pairs shortest paths using bridging sets and rectangular matrix multiplication", Journal of the ACM 49 (3): 289–317, DOI 10.1145/567112.567114.
Chan, Timothy M. (January 2010), "More algorithms for all-pairs shortest paths in weighted graphs", SIAM Journal on Computing 39 (5): 2075–2089, DOI 10.1137/08071990x.

Hochbaum: Section 8.9: Floyd-Warshall algorithm for all pairs shortest paths (PDF). Lecture Notes for IEOR 266: Graph Algorithms and Network Flows. Department of Industrial Engineering and Operations Research, University of California, Berkeley, 2014 [2016. október 20-i dátummal az eredetiből archiválva]. (Hozzáférés: 2020. június 11.)