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.
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… 
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… 
2006
2006
Comparison of Proposed Ospf Manet Extensions
The open shortest path first (OSPF) routing protocol performs inefficiently when operated over certain types of mobile ad hoc… 
2005
2005
Performance analysis of sparse traffic grooming in WDM mesh networks
Sparse traffic grooming is a practical problem to be addressed in heterogeneous multi-vendor optical WDM networks where only some… 
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… 
2004
2004
A path compression technique for on-demand ad-hoc routing protocols
Ad-hoc on-demand routing protocols like AODV establish and maintain routes on-demand. However, the paths established by on-demand… 
2004
2004
A novel broadcast scheduling strategy using factor graphs and the sum-product algorithm
This paper presents a novel self-organizing distributed algorithm for finding a broadcasting schedule in a packet radio network… 
2003
2003
Routing and wavelength assignment under inaccurate routing information in networks with sparse and limited wavelength conversion
In large dynamic networks it is extremely difficult to maintain accurate routing information on all network nodes. Different… 
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… 
1974
1974
On Neiman's Algorithm for the Control of Rearrangeable Switching Networks
Modifications to the first phase of Neiman's algorithm to control the rearrangeable switching networks (RSN) are presented. This…