2 citations · 2 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2017
Network Simplex Algorithm associated with the Maximum Flow Problem
Sennosuke Watanabe, Hodaka Tanaka, Yoshihide Watanabe
In the present paper, we apply the network simplex algorithm for solving the minimum cost flow problem, to the maximum flow problem. Then we prove that the cycling phenomenon which…
math.CO2017★ 2 cited
Two characteristic polynomials corresponding to graphical networks over min-plus algebra
Sennosuke Watanabe, Yuto Tozuka, Yoshihide Watanabe +2
In this paper, we investigate characteristic polynomials of matrices in min-plus algebra. Eigenvalues of min-plus matrices are known to be the minimum roots of the characteristic p…