Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
Dijkstra's algorithm
Description:
A graph-search algorithm that finds shortest paths from a starting vertex to other vertices in a weighted graph.
Related topics:
Complexity and Algorithms in Graphs (15%),
Robotic Path Planning Algorithms (11%)
Wikidata ID:
wiki/Q8548
OpenAlex ID:
keywords/dijkstra-s-algorithm
A shortest augmenting path algorithm for dense and sparse linear assignment problems
1987
·
R. Jonker
, A. Volgenant
·
Computing
·
1,276
Department of Computer Science
1993
·
Hylke Buisman
, Manuel Gomez-rodriguez
, et al.
·
Journal of Computational and Applied Mathematics
·
1,219
Efficient algorithms for globally optimal trajectories
1995
·
J.N. Tsitsiklis
·
IEEE Transactions on Automatic Control
·
870
The image foresting transform: theory, algorithms, and applications
2004
·
A.X. Falcao
, J. Stolfi
, et al.
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
620
Topology Dissemination Based on Reverse-Path Forwarding (TBRPF)
2004
·
R. Ogier
, F. Templin
, et al.
·
591
Faster algorithms for the shortest path problem
1990
·
Ravindra K. Ahuja
, Kurt Mehlhorn
, et al.
·
Journal of the ACM
·
558
PDF
Autonomous formation flight
2000
·
F. Giulietti
, L. Pollini
, et al.
·
IEEE Control Systems
·
509
PDF
Engineering Route Planning Algorithms
2009
·
Daniel Delling
, Peter Sanders
, et al.
·
Lecture notes in computer science
·
487
Undirected single-source shortest paths with positive integer weights in linear time
1999
·
Mikkel Thorup
·
Journal of the ACM
·
448
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
1994
·
Michael L. Fredman
, Dan E. Willard
·
Journal of Computer and System Sciences
·
419
Finding shortest paths on real road networks: the case for A*
2008
·
W. Zeng
, R. L. Church
·
International Journal of Geographical Information Systems
·
348
A Note on Dijkstra's Shortest Path Algorithm
1973
·
Donald B. Johnson
·
Journal of the ACM
·
331
PDF
Highway Hierarchies Hasten Exact Shortest Path Queries
2005
·
Peter Sanders
, Dominik Schultes
·
Lecture notes in computer science
·
330
Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
2000
·
J. A. Sethian
, A. Vladimirsky
·
Proceedings of the National Academy of Sciences
·
321
PDF
Shortest paths on a polyhedron
1990
·
Jindong Chen
, Yijie Han
·
Annual Symposium on Computational Geometry (SoCG)
·
313
PDF
Linear-space best-first search
1993
·
Richard E. Korf
·
Artificial Intelligence
·
305
A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices
1998
·
M. Barbehenn
·
IEEE Transactions on Computers
·
300
Application of Dijkstra algorithm in robot path-planning
2011
·
Huijuan Wang
, Yuan Yu
, et al.
·
International Conference on Mechanic Automation and Control Engineering
·
282
An ultra-fast user-steered image segmentation paradigm: live wire on the fly
2000
·
A.X. Falcao
, J.K. Udupa
, et al.
·
IEEE Transactions on Medical Imaging
·
278
Path planning in construction sites: performance evaluation of the Dijkstra, A∗, and GA search algorithms
2002
·
A.R. Soltani
, H. Tawfik
, et al.
·
Advanced Engineering Informatics
·
276
On some techniques useful for solution of transportation network problems
1971
·
N. Tomizawa
·
Networks
·
257
A comparative review on mobile robot path planning: Classical or meta-heuristic methods?
2020
·
Mohd Nadhir Ab Wahab
, Samia Nefti-Meziani
, et al.
·
Annual Reviews in Control
·
255
PDF
A data-driven approach for real-time full body pose reconstruction from a depth camera
2011
·
Andreas Baak
, Meinard Muller
, et al.
·
IEEE/CVF International Conference on Computer Vision (ICCV)
·
248
Spanning trees and optimization problems
2004
·
Choice Reviews Online
·
237
A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization
2017
·
Thi Thoa Mac
, Cosmin Copot
, et al.
·
Applied Soft Computing
·
231
PDF
Show more works
View as search
Works count:
9,544
Citation count:
73,820
Year
Topic
Type