An edge-wise linear shortest path algorithm for non negative weighted undirected graphs.
Muhammad Aasim QureshiMohd Fadzil HassanSohail SafdarRehan AkbarRabia SammiPublished in: FIT (2009)
Keyphrases
- undirected graph
- shortest path algorithm
- shortest path
- disjoint paths
- weighted graph
- directed graph
- spanning tree
- vertex set
- approximation algorithms
- complex networks
- directed acyclic graph
- connected components
- minimum cost
- graph structure
- edge weights
- pairwise
- positive integer
- minimum cost flow
- adjacency matrix
- markov models
- optimal solution
- random graphs
- strongly connected
- special case
- average degree