Fully dynamic shortest path algorithms for general hyper-graphs

In this paper, we consider the shortest path problem in hyper-graphs. We develop two algorithms for finding and maintaining the shortest hyper paths in a dynamic network with both weight and topological changes. These two algorithms are the first addressing the fully dynamic shortest path problem in a general hyper-graph. They complement each other by partitioning the application space based on the nature of the change dynamics and the type of the hyper-graph.