Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,842,912 papers from all fields of science
Search
Sign In
Create Free Account
Dijkstra's algorithm
Known as:
Dijkstra' algorithm
, Dykstra's algorithm
, Uniform-cost search
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Adjacency list
Admissible heuristic
Asymptotic computational complexity
Best, worst and average case
Expand
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
R. Thamilselvan
,
P. Balasubramanie
2009
Corpus ID: 18455053
One motivation of Grid computing (5) is to aggregate the power of widely distributed resources, and provide non-trivial services…
Expand
2009
2009
A Coarse-Grained Parallel Genetic Algorithm with Migration for Shortest Path Routing Problem
S. Yussof
,
R. Razali
,
O. See
,
Azimah Abdul Ghapar
,
M. Din
IEEE International Conference on High Performance…
2009
Corpus ID: 14532937
Shortest path routing is the type of routing widely used in computer networks nowadays. Even though shortest path routing…
Expand
2008
2008
A New and Efficient Algorithm to Binarize Document Images Removing Back-to-Front Interference
J. G. M. Silva
,
R. Lins
,
Fernando Mário Junqueira Martins
,
R. Wachenchauzer
Journal of universal computer science (Online)
2008
Corpus ID: 1918260
Back-to-front interference", "bleeding" and "show-through" is the name given to the phenomenon found whenever documents are…
Expand
2005
2005
Performance analysis of sparse traffic grooming in WDM mesh networks
W. Yao
,
Mengke Li
,
B. Ramamurthy
IEEE International Conference on Communications…
2005
Corpus ID: 9509038
Sparse traffic grooming is a practical problem to be addressed in heterogeneous multi-vendor optical WDM networks where only some…
Expand
2004
2004
Investigating Ahuja-Orlin''s Large Neighbourhood Search for Examination Timetabling
S. Abdullah
,
S. Ahmadi
,
E. Burke
2004
Corpus ID: 7716719
: Since the 1960’s automated approaches to examination timetabling have been explored and a wide variety of approaches have been…
Expand
2004
2004
El portfolio discente
Manuel Rico Vercher
,
C. Pérez
2004
Corpus ID: 150582703
o, de generalizar, de pasar de lo operatorio a lo formal, de lo inductivo a lo deductivo. Es el estadio evolutivo en que la razón…
Expand
Review
1998
Review
1998
Operationally optimal vertex-based shape coding
G. Schuster
,
G. Melnikov
,
A. Katsaggelos
IEEE Signal Processing Magazine
1998
Corpus ID: 16322768
In this article, we address the issue of operationally optimal shape encoding, which is a step in the direction of globally…
Expand
1998
1998
Updating Shortest Paths
S. Edelkamp
European Conference on Artificial Intelligence
1998
Corpus ID: 6611752
Stefan Edelkamp 1 Abstract. Moving target search is a state space approach for nding non-stationary goals. The plot is given by a…
Expand
1988
1988
The Design of a Hierarchical Transportation Network with Transshipment Facilities
J. Current
Transportation Science
1988
Corpus ID: 10493006
In this paper an integer linear program is formulated to identify the least cost two-level hierarchical network. This network…
Expand
1974
1974
On Neiman's Algorithm for the Control of Rearrangeable Switching Networks
N. Tsao-Wu
IEEE Transactions on Communications
1974
Corpus ID: 62685256
Modifications to the first phase of Neiman's algorithm to control the rearrangeable switching networks (RSN) are presented. This…
Expand