Email this article The minimum-cost transformation of graphs
- Authors: Gorbunov K.Y.1, Lyubetsky V.A.1,2
-
Affiliations:
- Kharkevich Institute for Information Transmission Problems
- Mechanics and Mathematics Faculty
- Issue: Vol 96, No 2 (2017)
- Pages: 503-505
- Section: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225402
- DOI: https://doi.org/10.1134/S1064562417050313
- ID: 225402
Cite item
Open Access
Access granted
Subscription Access
Abstract
A complete proof that algorithms proposed by the authors solve the problem of minimum-cost transformation of a graph into another graph is given. The problem is solved both by a direct algorithm of linear complexity and by a reduction to quadratic integer linear programming.
About the authors
K. Yu. Gorbunov
Kharkevich Institute for Information Transmission Problems
Author for correspondence.
Email: gorbunov@iitp.ru
Russian Federation, Moscow, 127051
V. A. Lyubetsky
Kharkevich Institute for Information Transmission Problems; Mechanics and Mathematics Faculty
Email: gorbunov@iitp.ru
Russian Federation, Moscow, 127051; Moscow, 119991
Supplementary files
