ScholarLens Back to search
2009•Journal of Discrete Mathematical Sciences and CryptographyRequires access

A novel single source shortest path algorithm

R. Uma Rani

Open publisher page 2 citations

Abstract

This paper presents a new algorithm for computing shortest paths in a nearly directed graph G = (V, E). The existing Dijkstra’s algorithm finds the shortest distance between given two vertices. This paper proposes a new algorithm which proves to be better than Dijkstra’s and Floyd’s algorithm in certain cases. The proposed algorithm is a single source shortest path algorithm which finds the shortest path and shortest distance from a single vertex in a graph to all other vertices in the graph.

About this research paper

What this paper is about

This paper presents a new algorithm for computing shortest paths in a nearly directed graph G = (V, E). The existing Dijkstra’s algorithm finds the shortest distance between given two vertices. This paper proposes a new algorithm which proves to be better than Dijkstra’s and Floyd’s algorithm in certain cases. The proposed algorithm is a single source shortest path algorithm which finds the shortest path and shortest distance from a single vertex in a graph to all other vertices in the graph.

Why it matters

OpenAlex reports 2 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

This paper presents a new algorithm for computing shortest paths in a nearly directed graph G = (V, E). The existing Dijkstra’s algorithm finds the shortest distance between given two vertices. This paper proposes a new algorithm which proves to be better than Dijkstra’s and Floyd’s algorithm in certain cases. The proposed algorithm is a single source shortest path algorithm which finds the shortest path and shortest distance from a single vertex in a graph to all other vertices in the graph.

Key concepts: Yen's algorithm, Suurballe's algorithm, Shortest Path Faster Algorithm, Shortest path problem, K shortest path routing, Floyd–Warshall algorithm, Dijkstra's algorithm, Distance

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
A novel single source shortest path algorithm — Research Paper | ScholarLens