Introduction to algorithms
Component-based software using RESOLVE
ACM SIGSOFT Software Engineering Notes
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
Recent results on the single-source shortest paths problem
ACM SIGACT News
A practical introduction to data structures and algorithms analysis, Java edition
A practical introduction to data structures and algorithms analysis, Java edition
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Note on Dijkstra's Shortest Path Algorithm
Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
New dynamic algorithms for shortest path tree computation
IEEE/ACM Transactions on Networking (TON)
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Software performance engineering of component-based systems
WOSP '04 Proceedings of the 4th international workshop on Software and performance
| Hi-index | 0.00 |
Communication and transportation network topologies routinely change due to link failures and link recovery or due to road construction and blockage. Therefore, the graphs representing these networks are dynamic in nature, i.e., they evolve over time due to edge insertion or deletion. To facilitate computation of shortest paths in dynamic graphs, this paper proposes an object-based software concept with a flexible, incremental interface and outlines its formal specification of behavior. Using this interface, a caller can switch back and forth between the edge insertion and shortest paths computation phases, adding edges, one at a time. Alternative components that implement the interface might amortize and optimize computation of shortest paths in changing graphs and provide interesting performance trade-offs.