Incremental computation of shortest paths in semi-dynamic graphs using software components.
Nighat YasminPublished in: ACM Southeast Regional Conference (2006)
Keyphrases
- shortest path
- software components
- finding the shortest path
- weighted graph
- software systems
- spatial networks
- betweenness centrality
- shortest path algorithm
- road network
- shortest path problem
- software modules
- software development
- software reuse
- building blocks
- strongly connected components
- reusable components
- source code
- edge weights
- minimum cost flow
- geodesic distance
- graph partitioning
- web services
- dynamic programming
- path length
- metric space
- dynamic environments
- relational databases