Skip to main content
SpringerLink
Log in

Extended Bellman Ford Algorithm with Optimized Time of Computation

  • Conference paper
  • First Online:
Proceedings of International Conference on ICT for Sustainable Development

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 409))

  • 1553 Accesses

Abstract

Large graphs having millions of vertices frequently used in many practical applications and are complicated to process. To process them, some fundamental single source shortest path (SSSP) algorithms like Dijkstra algorithm and Bellman Ford algorithm are available. Dijkstra algorithm is a competent sequential access algorithm but poorly suited for parallel architecture, whereas Bellman Ford algorithm is suited for parallel execution but this feature come at a higher cost. This paper introduces a new algorithm EBellflaging algorithm which enhances basic Bellman Ford algorithm to improve its efficiency over traditional Dijkstra algorithm and Bellman Ford algorithm and also reduces the space requirement of both the traditional approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Shivashankar, H., Suresh, N., Varaprasad, G., & Jayanthi, G. (2014). Designing energy routing protocol with power consumption optimization in manet. IEEE Transactions on Emerging Topics in Computing 2(2).

    Google Scholar 

  2. Othman, M. A., Sulaiman, H. A., Ismail, M. M., Misran, M. H., Meor, M. A. B., & Ramlee, R. A. (2013). An analysis of least-cost routing using bellman ford and dijkstra algorithms in wireless routing network. IJACT 5, 10(10).

    Google Scholar 

  3. Patel, V., & Baggar, C. (2014). A survey paper of bellman-ford algorithm and Dijkstra algorithm for finding shortest path in gis application. IJPTT 5, ISSN: 2249.

    Google Scholar 

  4. Crauser, A., Mehlhorn, K., Meyer, U., & Sanders, P. (1998). A parallelization of dijkstra’s shortest path algorithm (pp. 722–731). Berlin Heidelberg: Springer.

    Google Scholar 

  5. Thippeswamy, K., Hanumanthappa, J., & Manjaiah, D.H. (2014). A study on contrast and comparison between bellman-ford algorithm and Dijkstra’s algorithm. In National Conference on wireless Networks-09, Dec 2014.

    Google Scholar 

  6. MATLAB Tutorials. http://www.tutorialspoint.com/matlab.

  7. Bell, N., & Garland, M. (2009). Implementing sparse matrix-vector multiplication on throughput-oriented processors. In Proceedings of the 2009 ACM/IEEE Conference on Supercomputing, Nov. 2009 (pp. 18:1–18:11).

    Google Scholar 

  8. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.

    Google Scholar 

  9. Fredman, M. L., & Tarjan, R. E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3), 596–615.

    Google Scholar 

  10. Agarwal, P., & Dutta, M. (2015). New approach of bellman ford algorithm on gpu using compute unified design architecture. IJCA (0975–8887) 110(13), 11–15.

    Google Scholar 

  11. Horowitz, E., & Sahni, S. (1975). Fundamentals of computer algorithms.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Technological Institute of Textile & Sciences, Bhiwani, Haryana, India

    Neha & Akhil Kaushik

Authors
  1. Neha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akhil Kaushik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Neha .

Editor information

Editors and Affiliations

  1. Dept of Comp. Sci. & Engg, Anil Neerukonda Inst of Tech and Science, Visakhapatnam, India

    Suresh Chandra Satapathy

  2. Sabarkantha, Sabar Institute of Technology, Sabarkantha, Gujarat, India

    Amit Joshi

  3. Narsinhbhai Inst of Comp Studies & Mgmt, Gandhinagar, Gujarat, India

    Nilesh Modi

  4. Narsinhbhai Inst of Comp Studies & Mgmt, Gandhinagar, India

    Nisarg Pathak

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Neha, Kaushik, A. (2016). Extended Bellman Ford Algorithm with Optimized Time of Computation. In: Satapathy, S., Joshi, A., Modi, N., Pathak, N. (eds) Proceedings of International Conference on ICT for Sustainable Development. Advances in Intelligent Systems and Computing, vol 409. Springer, Singapore. https://doi.org/10.1007/978-981-10-0135-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0135-2_23

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0133-8

  • Online ISBN: 978-981-10-0135-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation