SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.

Satoshi Goto, Tatsuo Ohtsuki, Takeshi Yoshimura

Research output: Chapter in Book/Report/Conference proceedingChapter

7 Citations (Scopus)

Abstract

Two methods of implementing computer programs for solving the shortest path problem are presented. By symbolic processing, a computer program generates another program or an address table which represents an optimal shortest path algorithm, in the sense that only nontrivial operations required for a given particular network structure are executed. The implementation methods presented are powerful when a network of fixed sparseness structure must be solved repeatedly with different numerical values.

Original languageEnglish
Title of host publicationIEEE Trans Circuits Syst
Pages752-758
Number of pages7
VolumeCAS-23
Edition12
Publication statusPublished - 1976 Dec
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Goto, S., Ohtsuki, T., & Yoshimura, T. (1976). SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM. In IEEE Trans Circuits Syst (12 ed., Vol. CAS-23, pp. 752-758)