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.
|ジャーナル||NEC Research and Development|
|出版ステータス||Published - 1975 4月|
ASJC Scopus subject areas