Results 151 to 160 of about 3,683 (185)

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

Learning Kruskal’s Algorithm, Prim’s Algorithm and Dijkstra’s Algorithm by Board Game

2008
This paper describes the reasons about why it is beneficial to combine with graph theory and board game. Forbye, it also descants three graph theories: Dijkstra's, Prim's, and Kruskal's minimum spanning tree. Then it would describe the information about the board game we choose and how to combine the game with before-mentioned three graph theories.
Wen-Chih Chang, Yan-Da Chiu, Mao-Fan Li
openaire   +1 more source

Parallel Bidirectional Dijkstra's Shortest Path Algorithm

2011
This paper deals with Dijkstra's shortest path algorithm and with the possibilities of speeding-up this algorithm. This algorithm is a breadth-first-search algorithm. The search spreads circularly around the source node in order to find the shortest path from the source node to other nodes.
Gintaras Vaira, Olga Kurasova
openaire   +1 more source

Dijkstra’s Algorithm — The First Look

2015
I’ll start the chapter with the description of Dijkstra’s algorithm from the Math Wiki site; it’s a very elegant description and one that is worth reading:
openaire   +1 more source

Dijkstra’s Algorithm – The Closest Look

2015
Chapter 20 introduced Dijkstra’s algorithm. Here, we take a closer look at its workings, picking up the example we’ve been using of the airline flight plan. We use the algorithm to first determine the shortest among the links directly connected to the origin, so as to find the destination closest to it.
openaire   +1 more source

A Heuristic Integrated Scheduling Algorithm Based on Improved Dijkstra Algorithm

Electronics (Switzerland), 2023
Zhiqiang Xie, Zhenjiang Tan, Xie Zhiqiang   +2 more
exaly  

Path Planning of Rail-Mounted Logistics Robots Based on the Improved Dijkstra Algorithm

Applied Sciences (Switzerland), 2023
Weiyu Liu, Ruizhe Yang, Liu Weiyu
exaly  

A generalization of Dijkstra's algorithm

Information Processing Letters, 1977
openaire   +1 more source