Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths

Journal Title: Engineering, Technology & Applied Science Research - Year 2011, Vol 1, Issue 4

Abstract

In this paper we propose an experimental study model S3P2 of a fast fully dynamic programming algorithm design technique in finite directed graphs with few distinct nonnegative real edge weights. The Bellman-Ford’s approach for shortest path problems has come out in various implementations. In this paper the approach once again is re-investigated with adjacency matrix selection in associate least running time. The model tests proposed algorithm against arbitrarily but positive valued weighted digraphs introducing notion of Prograph that speeds up finding the shortest path over previous implementations. Our experiments have established abstract results with the intention that the proposed algorithm can consistently dominate other existing algorithms for Single Source Shortest Path Problems. A comparison study is also shown among Dijkstra’s algorithm, Bellman-Ford algorithm, and our algorithm.

Authors and Affiliations

B. Bhowmik, S. Nag Chowdhury

Keywords

Related Articles

Interface Structure and Elements Diffusion of As-Cast and Annealed Ductile Iron/Stainless Steel Bimetal Castings

Bimetal casting is considered to a promising technique for the production of high performance function materials. Heat treatment process for bimetal castings became an essential tool for improving interface structure and...

A Numerical Model for Caprock Analysis for Subsurface Gas Storage Applications

In considering a site for gas storage, it will be important to evaluate the effects of gas storage on the formation, so as to minimize the risk of a breach occurring in the system. Gas injection will result in an increas...

A Review on Direct Power Control for Applications to Grid Connected PWM Converters

The Direct Power Control strategy has become popular as an alternative to the conventional vector oriented control strategy for grid connected PWM converters. In this paper, Direct Power Control as applied to various app...

A Novel Image Stream Cipher Based On Dynamic Substitution

Recently, many chaos-based stream cipher algorithms have been developed. Traditional chaos stream cipher is based on XORing a generated secure random number sequence based on chaotic maps (e.g. logistic map, Bernoulli Ma...

An Assessment of the Impact of Information Technology on Marketing and Advertising

The present study aimed to evaluate the impact of Technology on Marketing and Advertising by using structural equations modeling. To do this, 200 marketing and information technology (IT) experts participated in the stud...

Download PDF file
  • EP ID EP84799
  • DOI -
  • Views 425
  • Downloads 0

How To Cite

B. Bhowmik, S. Nag Chowdhury (2011). Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths. Engineering, Technology & Applied Science Research, 1(4), -. https://www.europub.co.uk/articles/-A-84799