An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights.
K. B. LakshmananKrishnaiyan ThulasiramanM. A. ComeauPublished in: IEEE Trans. Software Eng. (1989)
Keyphrases
- shortest path
- edge weights
- wide area network
- path length
- shortest path algorithm
- betweenness centrality
- shortest path problem
- computer networks
- routing algorithm
- source node
- flow graph
- heterogeneous networks
- peer to peer
- strongly connected components
- spatial networks
- road network
- travel time
- weighted graph
- shortest distance
- social networks
- finding the shortest path
- small world
- bipartite graph
- minimum cost flow