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.
2012
2012
The COMICS Tool - Computing Minimal Counterexamples for DTMCs
This paper presents the tool COMICS 1.0, which performs model checking and generates counterexamples for DTMCs. For an input DTMC… 
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
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
17. THE FORMATION OF PLIOCENE MEDITERRANEAN SAPROPELS: CONSTRAINTS FROM HIGH-RESOLUTION MAJOR AND MINOR ELEMENT STUDIES 1
Two Pliocene Mediterranean sediment cores from Sites 964 (Pisano Plateau, Ionian Basin) and 967 (lower northern slope of… 
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… 
1997
1997
Fast computer graphics rendering for full parallax spatial displays
This paper presents a computer graphics algorithm useful for rapidly generating image data for full parallax spatial displays… 
Highly Cited
1995
Highly Cited
1995
A cut-based method for terminal-pair reliability
Terminal-pair reliability determines the probabilistic reliability between two nodes of a network, given the failure… 
1988
1988
The Design of a Hierarchical Transportation Network with Transshipment Facilities
In this paper an integer linear program is formulated to identify the least cost two-level hierarchical network. This network… 
Highly Cited
1987
Highly Cited
1987
Design and evaluation of algorithms to compute the transitive closure of a database relation
Recursive query evaluation is a capability of deductively-augmented database systems that conventional database systems do not… 
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)