Calculating Graph Algorithms for Dominance and Shortest Path.
Ilya SergeyJan MidtgaardDave ClarkePublished in: MPC (2012)
Keyphrases
- shortest path
- edge weights
- strongly connected components
- shortest path problem
- shortest path algorithm
- graph search
- minimum spanning tree
- weighted graph
- betweenness centrality
- graph theory
- minimum cost flow
- spanning tree
- complex networks
- path length
- flow graph
- distance transform
- minimal surface
- steiner tree
- optimization problems