登入選單
返回Google圖書搜尋
註釋This paper addresses the problem of directing the edges of a mixed Eulerian multigraph in such a way that the resulting directed multigraph is still Eulerian. It first reviews the literature on the problem and then shows that, by defining an appropriate quadratic function, the problem reduces to solving a maximal flow problem in a reduced network. An example problem is included.