Associative parallel algorithm for dynamic reconstruction of the shortest paths tree after insertion of a vertex

Finding shortest paths in a weighted graph is a fundamental and well studied problem in computer science. Such a problem arises in practice in different application settings.