SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.

Satoshi Goto*, Tatsuo Ohtsuki, Takeshi Yoshimura

*この研究の対応する著者

研究成果: Chapter

9 被引用数 (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
外部発表はい

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル