транспортная сеть Optimal Eulerian modification of digraphs by addition of arcs Authors: Gavrikov A. V. Тhe following problem is solved: given a directed graph, it is necessary to add to it a minimal number of arcs to obtain an Eulerian directed graph. Read more about Optimal Eulerian modification of digraphs by addition of arcs
