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

6doi.org

2^nd place

8^th place

1bnf.fr

124^th place

33^rd place

1web.archive.org

1^st place

1berkeley.edu

580^th place

467^th place

1goalkicker.com

low place

1books.google.com

3^rd place

28^th place

berkeley.edu (Global: 580^th place; Hungarian: 467^th place)

ieor.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.)

bnf.fr (Global: 124^th place; Hungarian: 33^rd place)

gallica.bnf.fr

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

books.google.com (Global: 3^rd place; Hungarian: 28^th place)

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>.

doi.org (Global: 2^nd place; Hungarian: 8^th place)

dx.doi.org

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.

goalkicker.com (Global: low place; Hungarian: low place)

books.goalkicker.com

https://books.goalkicker.com/AlgorithmsBook/

web.archive.org (Global: 1^st place; Hungarian: 1^st place)

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.)

Floyd–Warshall-algoritmus (Hungarian Wikipedia)

berkeley.edu (Global: 580th place; Hungarian: 467th place)