Shortest-Path Problem is not Harder Than Matrix Multiplication.

Francesco Romani

Published in: Inf. Process. Lett. (1980)

Keyphrases

shortest path problem
matrix multiplication
shortest path
interval data
single source
message passing
combinatorial optimization problems
multiple objectives
distributed memory
directed graph
directed acyclic graph
np hard
matrix factorization
optimization problems
recommender systems
combinatorial optimization