Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
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


Dokl. RAN. Math. Inf. Proc. Upr.:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia, 2020, Volume 494, Pages 26–29
DOI: https://doi.org/10.31857/S2686954320050343 (Mi danma111) 		 
This article is cited in 1 scientific paper (total in 1 paper)

MATHEMATICS

An almost exact linear algorithm for transformation of chain-cycle graphs with optimization of the sum of operation costs

K. Yu. Gorbunova, V. A. Lyubetskiiab

a Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow, Russian Federation
b Lomonosov Moscow State University, Moscow, Russian Federation
Full-text PDF (99 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S2686954320050343
Abstract: For weighted directed chain-cycle graphs, an algorithm transforming one graph into another is constructed. The algorithm runs in linear time and yields a sequence of transformations with the smallest, up to an additive error, total cost. The costs of the operations of inserting and deleting an edge segment may differ from each other and from the costs of the other operations. The additive error is estimated in terms of the operation costs.
Keywords: exact algorithm, graph transformation, 2-degree graph, chain-cycle graph, operation cost, DCJ-operations, discrete optimization.
Funding agency Grant number
Russian Foundation for Basic Research 18–29–13037
This work was supported by the Russian Foundation for Basic Research, project no. 18-29-13037.
Presented: A. L. Semenov
Received: 17.05.2020
Revised: 20.08.2020
Accepted: 28.08.2020
English version:
Doklady Mathematics, 2020, Volume 102, Issue 2, Pages 376–379
DOI: https://doi.org/10.1134/S1064562420050324
Bibliographic databases:
Document Type: Article
UDC: 519.178
Language: Russian
Citation: K. Yu. Gorbunov, V. A. Lyubetskii, “An almost exact linear algorithm for transformation of chain-cycle graphs with optimization of the sum of operation costs”, Dokl. RAN. Math. Inf. Proc. Upr., 494 (2020), 26–29; Dokl. Math., 102:2 (2020), 376–379
Citation in format AMSBIB
\Bibitem{GorLyu20}
\by K.~Yu.~Gorbunov, V.~A.~Lyubetskii
\paper An almost exact linear algorithm for transformation of chain-cycle graphs with optimization of the sum of operation costs
\jour Dokl. RAN. Math. Inf. Proc. Upr.
\yr 2020
\vol 494
\pages 26--29
\mathnet{http://mi.mathnet.ru/danma111}
\crossref{https://doi.org/10.31857/S2686954320050343}
\elib{https://elibrary.ru/item.asp?id=44344642}
\transl
\jour Dokl. Math.
\yr 2020
\vol 102
\issue 2
\pages 376--379
\crossref{https://doi.org/10.1134/S1064562420050324}
Linking options:
  • https://www.mathnet.ru/eng/danma111
  • https://www.mathnet.ru/eng/danma/v494/p26
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
    Statistics & downloads:
    Abstract page:89
    Full-text PDF :22
    References:16
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024