TITLE     : Shortest-path problem is not harder than matrix multiplication
AUTHOR(S) : Romani F.
TYPE      : Journal article
YEAR      : 1980
CODE      : 424907

*** DO NOT EDIT THIS FILE ***