抄録
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月 |
ASJC Scopus subject areas
- 電子工学および電気工学