戴克斯特拉算法 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "戴克斯特拉算法" in Chinese language version.

refsWebsite

Global rank Chinese rank

18web.archive.org

1^st place

16doi.org

2^nd place

23^rd place

2archive.org

6^th place

4^th place

2ams.org

451^st place

935^th place

2books.google.com

3^rd place

8^th place

2acm.org

1,185^th place

809^th place

1infona.pl

low place

1psu.edu

207^th place

628^th place

1whu.edu.cn

low place

2,609^th place

1tum.de

7,448^th place

low place

1aaai.org

9,352^nd place

low place

1mpg.de

1,624^th place

1,637^th place

1ieee.org

652^nd place

712^th place

1sysu.edu.cn

low place

3,433^rd place

1tue.nl

9,054^th place

9,973^rd place

1karabuk.edu.tr

low place

1cqvip.com

5,710^th place

212^th place

1harvard.edu

18^th place

57^th place

1ict.ac.cn

low place

1springer.com

274^th place

320^th place

1geeksforgeeks.org

low place

aaai.org

Felner, Ariel. Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. Proc. 4th Int'l Symp. on Combinatorial Search. 2011 [2020-02-18]. （原始内容存档于2020-02-18）.

acm.org

amturing.acm.org

Richards, Hamilton. Edsger Wybe Dijkstra. A.M. Turing Award. Association for Computing Machinery. [2017-10-16]. （原始内容存档于2017-10-21）. 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?

portal.acm.org

Fredman, Michael Lawrence; Tarjan, Robert E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery. 1987, 34 (3): 596–615 [2018-04-03]. doi:10.1145/28869.28874. （原始内容存档于2006-04-28）.

ams.org

Johnson, Donald B. A priority queue in which initialization and queue operations take $O (log log D)$ time. Mathematical Systems Theory. December 1981, 15 (1): 295–309. MR 0683047. doi:10.1007/BF01786986.
Karlsson, Rolf G.; Poblete, Patricio V. An $O (m log log D)$ algorithm for shortest paths. Discrete Applied Mathematics. 1983, 6 (1): 91–93. MR 0700028. doi:10.1016/0166-218X(83)90104-X.

archive.org

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Section 24.3: Dijkstra's algorithm. Introduction to Algorithms Second. MIT Press and McGraw–Hill. 2001: 595–601. ISBN 0-262-03293-7.
Rosen, Kenneth H. Discrete Mathematics and Its Applications. McGraw-Hill College. 2002. ISBN 0-07-293033-0.

books.google.com

De Smith, Michael John; Goodchild, Michael F.; Longley, Paul, Geospatial Analysis: A Comprehensive Guide to Principles, Techniques and Software Tools, Troubadour Publishing Ltd: 344, 2007 [2020-03-04], ISBN 9781905886609, （原始内容存档于2017-02-27） .
Hetland, Magnus Lie, Python Algorithms: Mastering Basic Algorithms in the Python Language, Apress: 214, 2010 [2020-03-04], ISBN 9781430232377, （原始内容存档于2017-02-28） .

cqvip.com

江琦浩. 迪杰斯特拉算法在企业成本控制研究中的应用. 中国商贸. 2012, (03X) [2020-12-24]. （原始内容存档于2021-02-13）.

doi.org

Fredman, Michael Lawrence; Tarjan, Robert E. Fibonacci heaps and their uses in improved network optimization algorithms. 25th Annual Symposium on Foundations of Computer Science. IEEE: 338–346. 1984. doi:10.1109/SFCS.1984.715934.
Frana, Phil. An Interview with Edsger W. Dijkstra. Communications of the ACM. August 2010, 53 (8): 41–47. doi:10.1145/1787234.1787249.
Dijkstra, E. W. A note on two problems in connexion with graphs (PDF). Numerische Mathematik. 1959, 1: 269–271 [2020-01-27]. doi:10.1007/BF01386390. （原始内容存档 (PDF)于2020-01-23）.
Mehlhorn, Kurt; Sanders, Peter. Chapter 10. Shortest Paths (PDF). Algorithms and Data Structures: The Basic Toolbox. Springer. 2008 [2020-02-14]. ISBN 978-3-540-77977-3. doi:10.1007/978-3-540-77978-0. （原始内容存档 (PDF)于2021-02-24）.
H. Ishikawa, S. Shimizu, Y. Arakawa, N. Yamanaka, K. Shiba. New Parallel Shortest Path Searching Algorithm based on Dynamically Reconfigurable Processor DAPDNA-2. IEEE. 13 August 2007 [2020-03-21]. doi:10.1109/ICC.2007.332. （原始内容存档于2020-12-18）.
Yefim, Dinitz; Rotem, Itzhak. Hybrid Bellman–Ford–Dijkstra algorithm,. Journal of Discrete Algorithms. 2017, 42: 35–44. doi:10.1016/j.jda.2017.01.001.
Johnson, Donald B. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM. 1977, 24 (1): 1–13. doi:10.1145/321992.321993.
Fredman, Michael Lawrence; Tarjan, Robert E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery. 1987, 34 (3): 596–615 [2018-04-03]. doi:10.1145/28869.28874. （原始内容存档于2006-04-28）.
Skiena, Steven. The Algorithm Design Manual (PDF) 2. Springer. 2008-07-26: 212 [2015-04-11]. ISBN 978-0073523408. doi:10.1007/978-1-84800-070-4. （原始内容 (PDF)存档于2015-06-09）（英语）.
见Pollack, Maurice; Wiebenson, Walter. Solution of the Shortest-Route Problem—A Review. Oper. Res. March–April 1960, 8 (2): 224–230. doi:10.1287/opre.8.2.224. Attributes Dijkstra's algorithm to Minty ("private communication") on p.225.
Whiting, P. D.; Hillier, J. A. A Method for Finding the Shortest Route through a Road Network. Operational Research Quarterly. March–June 1960, 11 (1/2): 37–40. doi:10.1057/jors.1960.32.
Johnson, Donald B. A priority queue in which initialization and queue operations take $O (log log D)$ time. Mathematical Systems Theory. December 1981, 15 (1): 295–309. MR 0683047. doi:10.1007/BF01786986.
Karlsson, Rolf G.; Poblete, Patricio V. An $O (m log log D)$ algorithm for shortest paths. Discrete Applied Mathematics. 1983, 6 (1): 91–93. MR 0700028. doi:10.1016/0166-218X(83)90104-X.
Sven Peyer; Dieter Rautenbach,Jens Vygen. A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. Journal of Discrete Algorithms. 2007, 7 (4): 377–390. doi:10.1016/j.jda.2007.08.003.
Dean Djokic,David R. Maidment. Application of GIS Network Routines for Water Flow and Transport. Journal of Water Resources Planning and Management. 1993, 119 (2). doi:10.1061/(ASCE)0733-9496(1993)119:2(229).
Prim, R.C. Shortest connection networks and some generalizations (PDF). Bell System Technical Journal. 1957, 36 (6): 1389–1401 [18 July 2017]. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. （原始内容 (PDF)存档于18 July 2017）.

geeksforgeeks.org

geeksforgeeks. Dijkstra’s Shortest Path Algorithm using priority_queue of STL. geeksforgeeks. [2020-05-11]. （原始内容存档于2021-02-13）.

harvard.edu

ui.adsabs.harvard.edu

Prim, R.C. Shortest connection networks and some generalizations (PDF). Bell System Technical Journal. 1957, 36 (6): 1389–1401 [18 July 2017]. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. （原始内容 (PDF)存档于18 July 2017）.

ict.ac.cn

bioinfo.ict.ac.cn

Prim, R.C. Shortest connection networks and some generalizations (PDF). Bell System Technical Journal. 1957, 36 (6): 1389–1401 [18 July 2017]. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. （原始内容 (PDF)存档于18 July 2017）.

ieee.org

ieeexplore.ieee.org

H. Ishikawa, S. Shimizu, Y. Arakawa, N. Yamanaka, K. Shiba. New Parallel Shortest Path Searching Algorithm based on Dynamically Reconfigurable Processor DAPDNA-2. IEEE. 13 August 2007 [2020-03-21]. doi:10.1109/ICC.2007.332. （原始内容存档于2020-12-18）.

infona.pl

有争议，见：Moshe Sniedovich. Dijkstra's algorithm revisited: the dynamic programming connexion. Control and Cybernetics. 2006, 35: 599–620 [2020-03-04]. （原始内容存档于2020-03-04）. 等

karabuk.edu.tr

web.karabuk.edu.tr

Ismail Rakip Karas，Sait Demir. Dijkstra algorithm interactive training software development for network analysis applications in GIS (PDF). Energy Education Science and Technology Part A: Energy Science and Research. 2011, 28: 445–452 [2020-03-04]. （原始内容存档 (PDF)于2020-03-04）.

mpg.de

people.mpi-inf.mpg.de

Mehlhorn, Kurt; Sanders, Peter. Chapter 10. Shortest Paths (PDF). Algorithms and Data Structures: The Basic Toolbox. Springer. 2008 [2020-02-14]. ISBN 978-3-540-77977-3. doi:10.1007/978-3-540-77978-0. （原始内容存档 (PDF)于2021-02-24）.

psu.edu

citeseerx.ist.psu.edu

Andrew V. Goldberg; Robert E. Tarjan. Expected performance of Dijkstra’s shortest path algorithm. NEC Research Institute Report. 1996年 [2019-12-12]. （原始内容存档于2021-11-22）.

springer.com

link.springer.com

Danielsson, Per-Erik; Lin, Qingfen. A Modified Fast Marching Method. Image Analysis. 24 June 2003: 1154–1161 [2020-03-25]. （原始内容存档于2021-02-13）.

sysu.edu.cn

sist.sysu.edu.cn

Skiena, Steven. The Algorithm Design Manual (PDF) 2. Springer. 2008-07-26: 212 [2015-04-11]. ISBN 978-0073523408. doi:10.1007/978-1-84800-070-4. （原始内容 (PDF)存档于2015-06-09）（英语）.

tue.nl

www-set.win.tue.nl

ARMAC. Unsung Heroes in Dutch Computing History. 2007. （原始内容存档于2013-11-13）.

tum.de

www-m3.ma.tum.de

Dijkstra, E. W. A note on two problems in connexion with graphs (PDF). Numerische Mathematik. 1959, 1: 269–271 [2020-01-27]. doi:10.1007/BF01386390. （原始内容存档 (PDF)于2020-01-23）.

web.archive.org

有争议，见：Moshe Sniedovich. Dijkstra's algorithm revisited: the dynamic programming connexion. Control and Cybernetics. 2006, 35: 599–620 [2020-03-04]. （原始内容存档于2020-03-04）. 等
Andrew V. Goldberg; Robert E. Tarjan. Expected performance of Dijkstra’s shortest path algorithm. NEC Research Institute Report. 1996年 [2019-12-12]. （原始内容存档于2021-11-22）.
乐阳、龚健雅. Dijkstra最短路径算法的一种高效率实现. 《科学技术创新》. 2020, (17): 75–77 [2020-06-30]. （原始内容存档于2021-02-13）.
Richards, Hamilton. Edsger Wybe Dijkstra. A.M. Turing Award. Association for Computing Machinery. [2017-10-16]. （原始内容存档于2017-10-21）. 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?
Dijkstra, E. W. A note on two problems in connexion with graphs (PDF). Numerische Mathematik. 1959, 1: 269–271 [2020-01-27]. doi:10.1007/BF01386390. （原始内容存档 (PDF)于2020-01-23）.
Felner, Ariel. Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm. Proc. 4th Int'l Symp. on Combinatorial Search. 2011 [2020-02-18]. （原始内容存档于2020-02-18）.
Mehlhorn, Kurt; Sanders, Peter. Chapter 10. Shortest Paths (PDF). Algorithms and Data Structures: The Basic Toolbox. Springer. 2008 [2020-02-14]. ISBN 978-3-540-77977-3. doi:10.1007/978-3-540-77978-0. （原始内容存档 (PDF)于2021-02-24）.
H. Ishikawa, S. Shimizu, Y. Arakawa, N. Yamanaka, K. Shiba. New Parallel Shortest Path Searching Algorithm based on Dynamically Reconfigurable Processor DAPDNA-2. IEEE. 13 August 2007 [2020-03-21]. doi:10.1109/ICC.2007.332. （原始内容存档于2020-12-18）.
Fredman, Michael Lawrence; Tarjan, Robert E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery. 1987, 34 (3): 596–615 [2018-04-03]. doi:10.1145/28869.28874. （原始内容存档于2006-04-28）.
Skiena, Steven. The Algorithm Design Manual (PDF) 2. Springer. 2008-07-26: 212 [2015-04-11]. ISBN 978-0073523408. doi:10.1007/978-1-84800-070-4. （原始内容 (PDF)存档于2015-06-09）（英语）.
ARMAC. Unsung Heroes in Dutch Computing History. 2007. （原始内容存档于2013-11-13）.
Ismail Rakip Karas，Sait Demir. Dijkstra algorithm interactive training software development for network analysis applications in GIS (PDF). Energy Education Science and Technology Part A: Energy Science and Research. 2011, 28: 445–452 [2020-03-04]. （原始内容存档 (PDF)于2020-03-04）.
江琦浩. 迪杰斯特拉算法在企业成本控制研究中的应用. 中国商贸. 2012, (03X) [2020-12-24]. （原始内容存档于2021-02-13）.
De Smith, Michael John; Goodchild, Michael F.; Longley, Paul, Geospatial Analysis: A Comprehensive Guide to Principles, Techniques and Software Tools, Troubadour Publishing Ltd: 344, 2007 [2020-03-04], ISBN 9781905886609, （原始内容存档于2017-02-27） .
Hetland, Magnus Lie, Python Algorithms: Mastering Basic Algorithms in the Python Language, Apress: 214, 2010 [2020-03-04], ISBN 9781430232377, （原始内容存档于2017-02-28） .
Prim, R.C. Shortest connection networks and some generalizations (PDF). Bell System Technical Journal. 1957, 36 (6): 1389–1401 [18 July 2017]. Bibcode:1957BSTJ...36.1389P. doi:10.1002/j.1538-7305.1957.tb01515.x. （原始内容 (PDF)存档于18 July 2017）.
Danielsson, Per-Erik; Lin, Qingfen. A Modified Fast Marching Method. Image Analysis. 24 June 2003: 1154–1161 [2020-03-25]. （原始内容存档于2021-02-13）.
geeksforgeeks. Dijkstra’s Shortest Path Algorithm using priority_queue of STL. geeksforgeeks. [2020-05-11]. （原始内容存档于2021-02-13）.

whu.edu.cn

ch.whu.edu.cn

乐阳、龚健雅. Dijkstra最短路径算法的一种高效率实现. 《科学技术创新》. 2020, (17): 75–77 [2020-06-30]. （原始内容存档于2021-02-13）.