Advertisement

A linear algorithm for the shortest transformation of graphs with different operation costs

  • K. Yu. Gorbunov
  • V. A. Lyubetsky
Mathematical Models and Computational Methods

Abstract

A novel time- and memory-efficient algorithm for solving the problem of finding the most economical (i.e., having the lowest overall cost) transformation of an arbitrary oriented graph representing a disjoint union of chains and cycles into another graph of the same type is proposed. The correctness of this algorithm (i.e., the fact that it always yields the minimum of the overall cost functional) and the linearity of the estimated memory and time of its operation are demonstrated.

Keywords

linear algorithm oriented graph chain cycle graph transformation operation cost combinatorial optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K. Yu. Gorbunov and V. A. Lyubetsky, “Linear algorithm for minimal rearrangement of structures,” Probl. Inf. Transmis. 51(1), 55–72 (2017).CrossRefGoogle Scholar
  2. 2.
    V. A. Lyubetsky, R. A. Gershgorin, A. V. Seliverstov, and K. Yu. Gorbunov, “Algorithms for reconstruction of chromosomal structures,” BMC Bioinformatics 17, 40 (2016).CrossRefGoogle Scholar

Copyright information

© Pleiades Publishing, Inc. 2017

Authors and Affiliations

  1. 1.Kharkevich Institute for Information Transmission ProblemsRussian Academy of SciencesMoscowRussia

Personalised recommendations