### 抜粋

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

- Electrical and Electronic Engineering

## フィンガープリント SIMPLEX ALGORITHM ON A LINEAR GRAPH - A UNIFIED VIEW OF THE EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH.' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

Ohtsuki, T., & Goto, S. (1975). SIMPLEX ALGORITHM ON A LINEAR GRAPH - A UNIFIED VIEW OF THE EXTREMAL PATH AND CUTSET PROBLEMS ON A GRAPH.

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