ScholarLens Back to search
2022•2022 International Mobile and Embedded Technology Conference (MECON)Requires access

A Comparison between Shortest Path Algorithms Using Runtime Analysis and Negative Edges in Computer Networks

T N S Koti Mani Kumar, UnniKiran Jaladhi, Sri Krishna Chaitanya Rudraraju, Vahiduddin Shariff, Venkata Rami Reddy, P A Harsha Vardhini

Open publisher page 12 citations

Abstract

Irrespective of the network, data is transferred from source to destination in a shortest path. This work investigates about the finest among shortest path algorithms (Dijkstra’s and Bellman ford). Data collected form Dijkstra’s and Bellman ford runtime analysis done on different system configurations. Using that data, the result of the shortest path algorithms is compared using the support of runtime of Dijkstra’s and Bellman ford on different systems. Theoretical and practical implications were discussed.

About this research paper

What this paper is about

Irrespective of the network, data is transferred from source to destination in a shortest path. This work investigates about the finest among shortest path algorithms (Dijkstra’s and Bellman ford). Data collected form Dijkstra’s and Bellman ford runtime analysis done on different system configurations. Using that data, the result of the shortest path algorithms is compared using the support of runtime of Dijkstra’s and Bellman ford on different systems. Theoretical and practical implications were discussed.

Why it matters

OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Irrespective of the network, data is transferred from source to destination in a shortest path. This work investigates about the finest among shortest path algorithms (Dijkstra’s and Bellman ford). Data collected form Dijkstra’s and Bellman ford runtime analysis done on different system configurations. Using that data, the result of the shortest path algorithms is compared using the support of runtime of Dijkstra’s and Bellman ford on different systems. Theoretical and practical implications were discussed.

Key concepts: Computer science, Algorithm, Shortest path problem, Path (computing), Theoretical computer science, Computer network, Graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Comparison between Shortest Path Algorithms Using Runtime Analysis and Negative Edges in Computer Networks — Research Paper | ScholarLens