### 抄録

A unified view of the extremum path and cutset problems in a graph has been presented, and a new algorithm to solve them has been proposed. All these problems have been solved by elementary tree transformations, a graph-theoretical iterative method. The relation between linear programming and the graph-theoretical method is considered. In the approach presented, the optimum can be expressed in the form of a general solution.

元の言語 | English |
---|---|

ページ（範囲） | 50-58 |

ページ数 | 9 |

ジャーナル | NEC Research and Development |

発行部数 | 37-38 |

出版物ステータス | Published - 1975 4 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### これを引用

*NEC Research and Development*, (37-38), 50-58.

**SIMPLEX ALGORITHM ON A LINEAR GRAPH - A UNIFIED VIEW OF THE EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH.** / Ohtsuki, Tatsuo; Goto, Satoshi.

研究成果: Article

*NEC Research and Development*, 番号 37-38, pp. 50-58.

}

TY - JOUR

T1 - SIMPLEX ALGORITHM ON A LINEAR GRAPH - A UNIFIED VIEW OF THE EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH.

AU - Ohtsuki, Tatsuo

AU - Goto, Satoshi

PY - 1975/4

Y1 - 1975/4

N2 - A unified view of the extremum path and cutset problems in a graph has been presented, and a new algorithm to solve them has been proposed. All these problems have been solved by elementary tree transformations, a graph-theoretical iterative method. The relation between linear programming and the graph-theoretical method is considered. In the approach presented, the optimum can be expressed in the form of a general solution.

AB - A unified view of the extremum path and cutset problems in a graph has been presented, and a new algorithm to solve them has been proposed. All these problems have been solved by elementary tree transformations, a graph-theoretical iterative method. The relation between linear programming and the graph-theoretical method is considered. In the approach presented, the optimum can be expressed in the form of a general solution.

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

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

M3 - Article

AN - SCOPUS:0016490035

SP - 50

EP - 58

JO - NEC Research and Development

JF - NEC Research and Development

SN - 0048-0436

IS - 37-38

ER -