An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem.
Tadao TakaokaKiyomi UmeharaPublished in: J. Parallel Distributed Comput. (1992)
Keyphrases
- shortest path problem
- computationally efficient
- data structure
- orders of magnitude
- benchmark datasets
- learning algorithm
- pairwise
- highly efficient
- theoretical analysis
- combinatorial optimization problems
- shortest path
- data sets
- signal processing
- benchmark problems
- data mining techniques
- high speed
- computational complexity
- interval data