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.
2013
2013
A Division Algorithm Using Bisection Method in Residue Number System
Residue Number System (RNS) has computational advantages for large integer arithmetic. It provides the benefits of parallel… 
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… 
Review
2009
Review
2009
A Genetic Algorithm with a Tabu Search (GTA) for Traveling Salesman Problem
One motivation of Grid computing (5) is to aggregate the power of widely distributed resources, and provide non-trivial services… 
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… 
2008
2008
A New and Efficient Algorithm to Binarize Document Images Removing Back-to-Front Interference
Back-to-front interference", "bleeding" and "show-through" is the name given to the phenomenon found whenever documents are… 
Highly Cited
2007
Highly Cited
2007
Gossip along the way: order-optimal consensus through randomized path averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for… 
2004
2004
Investigating Ahuja-Orlin''s Large Neighbourhood Search for Examination Timetabling
: Since the 1960’s automated approaches to examination timetabling have been explored and a wide variety of approaches have been… 
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… 
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… 
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… 
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)