Skip to search formSkip to main contentSkip to account menu

Dijkstra's algorithm

Known as: Dijkstra' algorithm, Dykstra's algorithm, Uniform-cost search 
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Adjacency listAdmissible heuristicAsymptotic computational complexityBest, worst and average case

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
An energy-efficient data gathering algorithm to prolong lifetime of wireless sensor networks
Highly Cited
2009
Highly Cited
2009
BULGES OF NEARBY GALAXIES WITH SPITZER: THE GROWTH OF PSEUDOBULGES IN DISK GALAXIES AND ITS CONNECTION TO OUTER DISKS
We study star formation rates (SFRs) and stellar masses in bulges of nearby disk galaxies. For this we construct a new SFR… 
Highly Cited
2008
Highly Cited
2008
A novel delay-aware routing algorithm (DARA) for a hybrid wireless-optical broadband access network (WOBAN)
A hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future access networks. Recently, the… 
Highly Cited
2008
Highly Cited
2008
Identifying geographically diverse routes for the transportation of hazardous materials
2003
2003
When and Why Ruppert's Algorithm Works
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm… 
Highly Cited
2002
Highly Cited
2002
Memory-Based Grammatical Relation Finding
Chapter 5 systematically tries to improve performance and/or speed and memory requirements by deleting superfluous features and… 
Highly Cited
2002
Highly Cited
2002
Hop-by-hop routing algorithms for premium-class traffic in DiffServ networks
For the provision of quality of service (QoS) in the Internet, differentiated service (DiffServ) has been proposed as a cost… 
Highly Cited
1998
Highly Cited
1998
Efficient solution procedure and reduced size formulations for p-hub location problems
Review
1998
Review
1998
Operationally optimal vertex-based shape coding
In this article, we address the issue of operationally optimal shape encoding, which is a step in the direction of globally… 
Highly Cited
1997
Highly Cited
1997
Video Distribution on Multicast Networks
  • N. Maxemchuk
  • IEEE J. Sel. Areas Commun.
  • 1997
  • Corpus ID: 12687008
The Internet is being used to distribute video programming to small, widely distributed audiences over a multicast backbone… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)