Open AccessTechnical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network
Author(s) -
Jin Y. Yen
Publication year - 1971
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.19.4.983
Subject(s) - decomposition , algorithm , computer science , point (geometry) , shortest path problem , efficient algorithm , mathematical optimization , mathematics , theoretical computer science , graph , ecology , geometry , biology
Hu and Torres have proposed a decomposition algorithm for finding the shortest paths between all pairs of nodes in a sparse network in which subnetworks are linearly overlapped. The purpose of this note is to point out how the efficiency of this algorithm can be improved by making a modification.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom