Abstract
Given a directed graph G, a source vertex s and shortest path tree (SPT), T(s) rooted at s in G, the dynamic shortest path problem is to find the new SPT, T′(s) in G from T(s) when update(s) on edge weight(s) are performed. Previous works focus either on single edge weight update at a time or, process a set of updates together with the constraint that edge weights remain positive. In this paper we propose two semi-dynamic algorithms (one for increase only and the other for decrease only case) for maintaining SPT in a directed graph, even when some of edge weights assume negative values. Our algorithms process multiple edge weight updates simultaneously and also able to detect presence of negative weight cycle if introduced during update, to assert that no real SPT exists. From experiments conducted, we observe that dynamic algorithms perform better than the static algorithm when the percentage of updated edges is smaller than a certain threshold.
Sign-in/Register to access full text options 
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.
