Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Peredachi Informatsii, 2017, Volume 53, Issue 1, Pages 60–78 (Mi ppi2228)  
This article is cited in 7 scientific papers (total in 7 papers)

Large Systems

Linear algorithm for minimal rearrangement of structures

K. Yu. Gorbunov, V. A. Lyubetsky

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (239 kB) Citations (7)
References:
PDF
HTML
Abstract: We propose a linear time and linear space algorithm which constructs a minimal sequence of operations rearranging one structure (directed graph of cycles and paths) into another. Structures in such a sequence may have a varying number of edges; a list of operations is fixed and includes deletion and insertion of a fragment of a structure. We give a complete proof that the algorithm is correct, i.e., finds the corresponding minimum.
Funding agency Grant number
Russian Science Foundation 14-50-00150
The research was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences at the expense of the Russian Science Foundation, project no. 14-50-00150.
Received: 29.12.2014
Revised: 25.04.2016
English version:
Problems of Information Transmission, 2017, Volume 53, Issue 1, Pages 55–72
DOI: https://doi.org/10.1134/S0032946017010057
Bibliographic databases:
Document Type: Article
UDC: 621.391 : 519.1
Language: Russian
Citation: K. Yu. Gorbunov, V. A. Lyubetsky, “Linear algorithm for minimal rearrangement of structures”, Probl. Peredachi Inf., 53:1 (2017), 60–78; Problems Inform. Transmission, 53:1 (2017), 55–72
Citation in format AMSBIB
\Bibitem{GorLyu17}
\by K.~Yu.~Gorbunov, V.~A.~Lyubetsky
\paper Linear algorithm for minimal rearrangement of structures
\jour Probl. Peredachi Inf.
\yr 2017
\vol 53
\issue 1
\pages 60--78
\mathnet{http://mi.mathnet.ru/ppi2228}
\elib{https://elibrary.ru/item.asp?id=28876248}
\transl
\jour Problems Inform. Transmission
\yr 2017
\vol 53
\issue 1
\pages 55--72
\crossref{https://doi.org/10.1134/S0032946017010057}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000399821500005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85018193412}
Linking options:
  • https://www.mathnet.ru/eng/ppi2228
  • https://www.mathnet.ru/eng/ppi/v53/i1/p60
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:253
    Full-text PDF :40
    References:37
    First page:12
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024