플로이드-워셜 알고리즘 (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "플로이드-워셜 알고리즘" in Korean language version.

refsWebsite

Global rank Korean rank

2^nd place

3^rd place

513^th place

230^th place

1web.archive.org

1^st place

1^st place

580^th place

476^th place

1sciencedirect.com

149^th place

122^nd place

1books.google.com

3^rd place

9^th place

207^th place

220^th place

69^th place

54^th place

arxiv.org (Global: 69^th place; Korean: 54^th place)

Zwick, Uri (May 2002), “All pairs shortest paths using bridging sets and rectangular matrix multiplication”, 《Journal of the ACM》 49 (3): 289–317, arXiv:cs/0008011, doi:10.1145/567112.567114 .

berkeley.edu (Global: 580^th place; Korean: 476^th place)

ieor.berkeley.edu

Hochbaum, Dorit (2014). “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. 2016년 10월 20일에 원본 문서 (PDF)에서 보존된 문서. 2018년 7월 9일에 확인함.

books.google.com (Global: 3^rd place; Korean: 9^th place)

Gross, Jonathan L.; Yellen, Jay (2003), 《Handbook of Graph Theory》, Discrete Mathematics and Its Applications, CRC Press, 65쪽, ISBN 9780203490204 .

doi.org (Global: 2^nd place; Korean: 3^rd place)

dx.doi.org

Floyd, Robert W. (June 1962). “Algorithm 97: Shortest Path”. 《Communications of the ACM》 5 (6): 345. doi:10.1145/367766.368168.
Warshall, Stephen (January 1962). “A theorem on Boolean matrices”. 《Journal of the ACM》 9 (1): 11–12. doi:10.1145/321105.321107.
Ingerman, Peter Z. (November 1962). “Algorithm 141: Path Matrix”. 《Communications of the ACM》 5 (11): 556. doi:10.1145/368996.369016.
Stefan Hougardy (April 2010). “The Floyd-Warshall algorithm on graphs with negative cycles”. 《Information Processing Letters》 110 (8-9): 279–281. 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, arXiv:cs/0008011, 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 .

psu.edu (Global: 207^th place; Korean: 220^th place)

citeseerx.ist.psu.edu

Penaloza, Rafael. “Algebraic Structures for Transitive Closure”.

sciencedirect.com (Global: 149^th place; Korean: 122^nd place)

Stefan Hougardy (April 2010). “The Floyd-Warshall algorithm on graphs with negative cycles”. 《Information Processing Letters》 110 (8-9): 279–281. doi:10.1016/j.ipl.2010.02.001.

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

Hochbaum, Dorit (2014). “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. 2016년 10월 20일에 원본 문서 (PDF)에서 보존된 문서. 2018년 7월 9일에 확인함.

wolfram.com (Global: 513^th place; Korean: 230^th place)

mathworld.wolfram.com

Weisstein, Eric Wolfgang. “Floyd-Warshall Algorithm” (영어). 《Wolfram MathWorld》. Wolfram Research.