Results 191 to 200 of about 4,817 (226)

ENHANCED HEAP FOR DIJKSTRA'S ALGORITHM

Abstract Success of min heap is because of its typical structure with parents containing values smaller than their children which makes them faster for sorting n elements in n  time. This motivated Dijkstra to implement its ‘single source shortest path’ algorithm using min heap. However, one drawback of the min heap is its self-destructive nature that
ANUBHAV KUMAR PRASAD, ARUNI SINGH
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 algorithm in parallel- Case study

Proceedings of the 2015 16th International Carpathian Control Conference (ICCC), 2015
This article aims to highlight the usefulness of improving classical algorithms by generating new approaches, efficiency or parallel execution time optimization at all costs. The reconsideration of classical algorithms, but in different testing conditions can help all products that rely on them.
openaire   +1 more source

On Dijkstra’s Algorithm for Deadlock Detection

2009
We study a classical problem in operating systems concerning deadlock detection for systems with reusable resources. The elegant Dijkstra’s algorithm utilizes simple data structures, but it has the cost of quadratic dependence on the number of the processes.
Youming Li, Ardian Greca, James Harris
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

Clinical management of metastatic colorectal cancer in the era of precision medicine

Ca-A Cancer Journal for Clinicians, 2022
, Davide Ciardiello, Giulia Martini
exaly  

Dijkstra's algorithm

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

Optimizing Flights Routes with Dijkstra's Algorithm

In this project, we address the optimization challenge of flight route planning within a given network of airports, emphasizing scenarios where direct flights are unavailable. The primary objective is to find the shortest path, considering factors such as flight distance or time, between a specified source and destination airport.
Singh, Yash, Trehan, Lakshay
openaire   +1 more source

The Arithmetic Optimization Algorithm

Computer Methods in Applied Mechanics and Engineering, 2021
Laith Mohammad Abualigah, Ali H Diabat, Seyedali Mirjalili   +2 more
exaly  

Head and neck cancers—major changes in the American Joint Committee on cancer eighth edition cancer staging manual

Ca-A Cancer Journal for Clinicians, 2017
William M Lydiatt, Snehal G Patel, Brian O'Sullivan   +2 more
exaly