SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.

Satoshi Goto, Tatsuo Ohtsuki, Takeshi Yoshimura

研究成果: Chapter

7 引用 (Scopus)

抜粋

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.

元の言語English
ホスト出版物のタイトルIEEE Trans Circuits Syst
ページ752-758
ページ数7
CAS-23
エディション12
出版物ステータスPublished - 1976 12
外部発表Yes

ASJC Scopus subject areas

  • Engineering(all)

フィンガープリント SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

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