Results 141 to 150 of about 959 (166)

Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm

Proceedings of the International Symposium on Combinatorial Search, 2021
Dijkstra's single-source shortest-path algorithm (DA) is one of the well-known, fundamental algorithms in computer science and related fields. DA is commonly taught in undergraduate courses. Uniform-cost search (UCS) is a simple version of the best-first search scheme which is logically equivalent to DA.
openaire   +1 more source

A parallelization of Dijkstra's shortest path algorithm

1998
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel.
Crauser, A., Mehlhorn, K., Meyer, U., Sanders, P.   +3 more
openaire   +2 more sources

Two Block Partitioned Dijkstra Algorithms

2013 IEEE 78th Vehicular Technology Conference (VTC Fall), 2013
The Dijkstra algorithm (DA) is a kind of tree search algorithm. The biggest advantage is that it has the smallest number of visited nodes among all optimal tree search algorithms. But stack sizes required by the DA are always too large to achieve. By partitioning the searching tree into blocks, two modified algorithms are proposed in this article to ...
Xinyu Mao, Yuxin Cheng, Haige Xiang
openaire   +1 more source

A Note on Dijkstra's Shortest Path Algorithm

Journal of the ACM, 1973
An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in O ( n 3 ) steps is disproved by showing a set of networks which take O ( n 2 n
openaire   +2 more sources

Dijkstra Algorithm Based Reliability Model

2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications, 2012
The increased use of virtual connections in packet switched networks, in particular over the Internet, using MPLS and GMPLS evolution has produced a significant amount of studies on traffic engineering protocols, especially with regard to the different ways to provide quality of service over connections.
Octavio J. Salcedo Parra, Gustavo López Rubio, Lilia Castellanos   +2 more
openaire   +1 more source

Dijkstra’s algorithm and L-concave function maximization

Mathematical Programming, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kazuo Murota, Akiyoshi Shioura
openaire   +2 more sources

Understanding Dijkstra Algorithm

SSRN Electronic Journal, 2013
Dijkstra's algorithm (named after its discover, E.W. Dijkstra) solves the problem of finding the shortest path from a point in a graph (the source) to a destination. It turns out that one can find the shortest paths from a given source to all points in a graph in the same time, hence this problem is sometimes called the single-source shortest paths ...
openaire   +1 more source

Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm

Mathematics of Operations Research, 2002
The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc lengths represent operation durations. The graphs have two types of nodes—AND-nodes and OR-nodes.
George M. Adelson-Velsky, Eugene Levner
openaire   +1 more source

Routing space Internet based on Dijkstra's algorithm

2009 First Asian Himalayas International Conference on Internet, 2009
Space Based Internets will be used to move earth observation data through satellite constellations to ground based receiving stations. Routing observation traffic in this environment is constrained by individual satellite orbits, individual satellite capabilities, observation schedules, ground station schedules, and rapidly evolving natural events ...
Xiang-ying Li, Guo-shun Li, Sheng-tian Zhang   +2 more
openaire   +1 more source

Study the optimization of Dijkstra’s Algorithm

Journal of Ravishankar University (PART-B)
This paper presents an optimized approach to the shortest path problem, a fundamental concern in graph theory, by improving node selection and data storage. The traditional Dijkstra's algorithm is enhanced by introducing a novel node selection strategy that prioritizes nodes with the most significant impact on the shortest path, minimizing redundant
Parmanand Parmanand, Sahdev Sahdev, Anuradha Dwivedi   +2 more
openaire   +1 more source