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

Computer program listings
Processing

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)

SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM. / Goto, Satoshi; Ohtsuki, Tatsuo; Yoshimura, Takeshi.

IEEE Trans Circuits Syst. Vol. CAS-23 12. ed. 1976. p. 752-758.

Research output: Chapter in Book/Report/Conference proceedingChapter

Goto, S, Ohtsuki, T & Yoshimura, T 1976, SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM. in IEEE Trans Circuits Syst. 12 edn, vol. CAS-23, pp. 752-758.
Goto S, Ohtsuki T, Yoshimura T. SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM. In IEEE Trans Circuits Syst. 12 ed. Vol. CAS-23. 1976. p. 752-758
Goto, Satoshi ; Ohtsuki, Tatsuo ; Yoshimura, Takeshi. / SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM. IEEE Trans Circuits Syst. Vol. CAS-23 12. ed. 1976. pp. 752-758
@inbook{85219ad2f6d748d9863720662ade8b13,
title = "SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.",
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.",
author = "Satoshi Goto and Tatsuo Ohtsuki and Takeshi Yoshimura",
year = "1976",
month = "12",
language = "English",
volume = "CAS-23",
pages = "752--758",
booktitle = "IEEE Trans Circuits Syst",
edition = "12",

}

TY - CHAP

T1 - SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.

AU - Goto, Satoshi

AU - Ohtsuki, Tatsuo

AU - Yoshimura, Takeshi

PY - 1976/12

Y1 - 1976/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0017219893&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0017219893&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:0017219893

VL - CAS-23

SP - 752

EP - 758

BT - IEEE Trans Circuits Syst

ER -