) algorithm for the all-pairs shortest path problem on an interval graph.
Prakash MirchandaniPublished in: Networks (1996)
Keyphrases
- shortest path problem
- single source
- interval data
- shortest path
- objective function
- directed graph
- cost function
- np hard
- dynamic programming
- graph based algorithm
- knapsack problem
- optimization algorithm
- segmentation algorithm
- simulated annealing
- learning algorithm
- neural network
- worst case
- upper bound
- expectation maximization
- undirected graph
- spanning tree
- graph structure
- minimum length
- bayesian networks
- optimal solution
- graph partitioning
- multiple objectives
- weighted graph
- graph theory
- graph matching
- computational complexity
- greedy algorithm
- k means
- graph cuts