A New Algorithm to Compute Single Source Shortest Path in a Real Edge Weighted Graph to Optimize Time Complexity.
Fahim AhmedFahim AnzumMuhammad Nazrul IslamWali Mohammad AbdullahSazid Al AhsanMoneruzzaman RanaPublished in: ICIS (2018)
Keyphrases
- weighted graph
- worst case
- computational complexity
- minimum spanning tree
- shortest path
- optimal solution
- graph partitioning
- probabilistic model
- data clustering
- vertex set
- matching algorithm
- segmentation algorithm
- np hard
- k means
- tree structure
- clustering method
- graph model
- graph clustering
- greedy heuristic
- minimum weight
- minimum cut