|
Computer science
Optimal Eulerian modification of digraphs by addition of arcs
A. V. Gavrikov Saratov State University, Chair of the Theoretical Foundations of Computer Security and Cryptography
Abstract:
Т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.
Key words:
graph theory, Eulerian graphs, modification of digraphs, transport network, min-cost-max-flow, addition of arch.
Citation:
A. V. Gavrikov, “Optimal Eulerian modification of digraphs by addition of arcs”, Izv. Saratov Univ. Math. Mech. Inform., 12:1 (2012), 102–109
Linking options:
https://www.mathnet.ru/eng/isu287 https://www.mathnet.ru/eng/isu/v12/i1/p102
|
|