A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs
Muhammad Aasim QureshiMohd Fadzil Bin HassanSohail SafdarRehan AkbarPublished in: CoRR (2009)
Keyphrases
- shortest path algorithm
- undirected graph
- shortest path
- directed graph
- directed acyclic graph
- minimum cost flow
- optimal solution
- approximation algorithms
- weighted graph
- spanning tree
- minimum cost
- vertex set
- disjoint paths
- complex networks
- graph structure
- connected components
- markov models
- random graphs
- multicommodity flow
- pairwise
- strongly connected
- higher order
- bayesian networks
- positive integer
- markov random field