데이크스트라 알고리즘 (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "데이크스트라 알고리즘" in Korean language version.

refsWebsite

Global rank Korean rank

5doi.org

2^nd place

3^rd place

3web.archive.org

1^st place

1acm.org

1,185^th place

449^th place

1tum.de

7,448^th place

low place

1mpg.de

1,624^th place

786^th place

1aaai.org

9,352^nd place

low place

1tue.nl

9,054^th place

1,881^st place

1utexas.edu

916^th place

819^th place

1ict.ac.cn

low place

1sunysb.edu

9,785^th place

3,758^th place

1umd.edu

1,747^th place

849^th place

1boost.org

low place

7,566^th place

1wikipedia.org

low place

1icm.edu.pl

2,656^th place

2,699^th place

1unimelb.edu.au

3,221^st place

8,254^th place

aaai.org

Felner, Ariel (2011). 《Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm》. Proc. 4th Int'l Symp. on Combinatorial Search. 2020년 2월 18일에 원본 문서에서 보존된 문서. 2018년 6월 21일에 확인함.

acm.org

amturing.acm.org

Richards, Hamilton. “Edsger Wybe Dijkstra”. 《A.M. Turing Award》. Association for Computing Machinery. 2017년 10월 16일에 확인함. At the Mathematical Centre a major project was building the ARMAC computer. For its official inauguration in 1956, Dijkstra devised a program to solve a problem interesting to a nontechnical audience: Given a network of roads connecting cities, what is the shortest route between two designated cities?

boost.org

http://www.boost.org/doc/libs/1_44_0/libs/graph/doc/dag_shortest_paths.html

doi.org

dx.doi.org

Frana, Phil (August 2010). “An Interview with Edsger W. Dijkstra”. 《Communications of the ACM》 53 (8): 41–47. doi:10.1145/1787234.1787249.
Dijkstra, E. W. (1959). “A note on two problems in connexion with graphs” (PDF). 《Numerische Mathematik》 1: 269–271. doi:10.1007/BF01386390.
Mehlhorn, Kurt; Sanders, Peter (2008). 〈Chapter 10. Shortest Paths〉 (PDF). 《Algorithms and Data Structures: The Basic Toolbox》. Springer. doi:10.1007/978-3-540-77978-0. ISBN 978-3-540-77977-3.
Prim, R.C. (1957). “Shortest connection networks and some generalizations” (PDF). 《Bell System Technical Journal》 36: 1389–1401. doi:10.1002/j.1538-7305.1957.tb01515.x. 18 July 2017에 원본 문서 (PDF)에서 보존된 문서. 21 June 2018에 확인함.
또는 종종 최소 비용 우선 탐색이라고도 불린다: Nau, Dana S. (1983). “Expert computer systems” (PDF). 《Computer》 (IEEE) 16 (2): 63–85. doi:10.1109/mc.1983.1654302.

icm.edu.pl

matwbn.icm.edu.pl

Sniedovich, M. (2006). “Dijkstra’s algorithm revisited: the dynamic programming connexion” (PDF). 《Journal of Control and Cybernetics》 35 (3): 599–620. 인터랙티브 계산 모듈이 있는 논문의 온라인 버전.

ict.ac.cn

bioinfo.ict.ac.cn

Prim, R.C. (1957). “Shortest connection networks and some generalizations” (PDF). 《Bell System Technical Journal》 36: 1389–1401. doi:10.1002/j.1538-7305.1957.tb01515.x. 18 July 2017에 원본 문서 (PDF)에서 보존된 문서. 21 June 2018에 확인함.

mpg.de

people.mpi-inf.mpg.de

Mehlhorn, Kurt; Sanders, Peter (2008). 〈Chapter 10. Shortest Paths〉 (PDF). 《Algorithms and Data Structures: The Basic Toolbox》. Springer. doi:10.1007/978-3-540-77978-0. ISBN 978-3-540-77977-3.

sunysb.edu

cs.sunysb.edu

Chen, M.; Chowdhury, R. A.; Ramachandran, V.; Roche, D. L.; Tong, L. (2007). 《Priority Queues and Dijkstra’s Algorithm — UTCS Technical Report TR-07-54 — 12 October 2007》 (PDF). Austin, Texas: The University of Texas at Austin, Department of Computer Sciences.

tue.nl

www-set.win.tue.nl

“ARMAC”. 《Unsung Heroes in Dutch Computing History》. 2007. 13 November 2013에 원본 문서에서 보존된 문서.

tum.de

www-m3.ma.tum.de

Dijkstra, E. W. (1959). “A note on two problems in connexion with graphs” (PDF). 《Numerische Mathematik》 1: 269–271. doi:10.1007/BF01386390.

umd.edu

cs.umd.edu

또는 종종 최소 비용 우선 탐색이라고도 불린다: Nau, Dana S. (1983). “Expert computer systems” (PDF). 《Computer》 (IEEE) 16 (2): 63–85. doi:10.1109/mc.1983.1654302.

unimelb.edu.au

ifors.ms.unimelb.edu.au

Sniedovich, M. (2006). “Dijkstra’s algorithm revisited: the dynamic programming connexion” (PDF). 《Journal of Control and Cybernetics》 35 (3): 599–620. 인터랙티브 계산 모듈이 있는 논문의 온라인 버전.

utexas.edu

cs.utexas.edu

Dijkstra, Edsger W., 《Reflections on "A note on two problems in connexion with graphs》 (PDF)

web.archive.org

Felner, Ariel (2011). 《Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm》. Proc. 4th Int'l Symp. on Combinatorial Search. 2020년 2월 18일에 원본 문서에서 보존된 문서. 2018년 6월 21일에 확인함.
“ARMAC”. 《Unsung Heroes in Dutch Computing History》. 2007. 13 November 2013에 원본 문서에서 보존된 문서.
Prim, R.C. (1957). “Shortest connection networks and some generalizations” (PDF). 《Bell System Technical Journal》 36: 1389–1401. doi:10.1002/j.1538-7305.1957.tb01515.x. 18 July 2017에 원본 문서 (PDF)에서 보존된 문서. 21 June 2018에 확인함.

wikipedia.org

en.wikipedia.org

Cormen 등. 2001, 655쪽