Abstract
A new algorithm to find the shortest path between a pair of nodes is presented. In one hand this algorithm expands the search from origin and destination simultaneously, on the other hand it uses a lower bound for the shortest path to guide this search. Computational comparisons with existing algorithms show its efficiency. The implementation on a parallel computer is also discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
