Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Izv. Saratov Univ. Math. Mech. Inform.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, 2012, Volume 12, Issue 1, Pages 102–109
DOI: https://doi.org/10.18500/1816-9791-2012-12-1-102-109
(Mi isu287)
 

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
References:
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.
Bibliographic databases:
Document Type: Article
UDC: 519.1
Language: Russian
Citation: A. V. Gavrikov, “Optimal Eulerian modification of digraphs by addition of arcs”, Izv. Saratov Univ. Math. Mech. Inform., 12:1 (2012), 102–109
Citation in format AMSBIB
\Bibitem{Gav12}
\by A.~V.~Gavrikov
\paper Optimal Eulerian modification of digraphs by addition of arcs
\jour Izv. Saratov Univ. Math. Mech. Inform.
\yr 2012
\vol 12
\issue 1
\pages 102--109
\mathnet{http://mi.mathnet.ru/isu287}
\crossref{https://doi.org/10.18500/1816-9791-2012-12-1-102-109}
\elib{https://elibrary.ru/item.asp?id=17574812}
Linking options:
  • https://www.mathnet.ru/eng/isu287
  • https://www.mathnet.ru/eng/isu/v12/i1/p102
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Известия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024