Open AccessA Fine Tuned Hybrid Implementation for Solving Shortest Path Problems using Bellman Ford
Author(s) -
Gaurav Hajela,
Manish Pandey
Publication year - 2014
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/17347-7360
Subject(s) - computer science , shortest path problem , path (computing) , mathematical optimization , operations research , theoretical computer science , computer network , mathematics , graph