SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.

Satoshi Goto; Tatsuo Ohtsuki; Takeshi Yoshimura

SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.

Satoshi Goto, Tatsuo Ohtsuki, Takeshi Yoshimura

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 language	English
Title of host publication	IEEE Trans Circuits Syst
Pages	752-758
Number of pages	7
Volume	CAS-23
Edition	12
Publication status	Published - 1976 Dec
Externally published	Yes

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)

@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 = dec

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 -

SPARSE MATRIX TECHNIQUES FOR THE SHORTEST PATH PROBLEM.

Abstract

Fingerprint

ASJC Scopus subject areas

Cite this

Access to Document