... Problems and its Application to the Shortest Path Problem . Management Science 18 , 401–405 ( 1972 ) 7. Nepomniaschaya , A.S .: Language STAR for Associative and Parallel Computation with Vertical Data Processing . In : Mirenkov , N ...

... PROBLEMS Problems that can be identified as graph - theoretic show up in diverse areas , e.g. traffic planning and network analysis . A common task is to find the shortest path between two vertices of a graph . The connection between ...

... shortest - paths problem , we compute the shortest - path weights by extending shortest paths edge by edge . Letting ... associative , so is matrix multiplication defined by the EXTEND - SHORTEST - PATHS procedure ( see Exercise ...

Shortest path algorithms have been studied since the 1950's and still remain an active area of research. This volume reports on the research carried out by participa.