ms·1967년 9월 1일
The Cascade Algorithm for Finding all Shortest Distances in a Directed Graph
Barbara Farbey, A. H. Land, J. D. Murchland
Management Science
42
피인용
10.0
FWCI
1
IS/마케팅/OM 탑저널 피인용
6
IS/마케팅/OM 탑저널 참고문헌
- 주제네트워크 흐름 최적화 · 생산·최적화
01Abstract
Matrix methods for finding shortest distances are convenient and efficient when the lengths of shortest paths are wanted between all pairs of vertices in a graph. The Cascade algorithm requires substantially fewer operations to find these distances than does the standard matrix method.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 14(1) · 19–28
- 토픽Graph Theory and Algorithms · Computer Vision and Pattern Recognition
- DOI10.1287/mnsc.14.1.19
- 저자Barbara Farbey, A. H. Land, J. D. Murchland