电邮这篇文章 The minimum-cost transformation of graphs
- 作者: Gorbunov K.Y.1, Lyubetsky V.A.1,2
-
隶属关系:
- Kharkevich Institute for Information Transmission Problems
- Mechanics and Mathematics Faculty
- 期: 卷 96, 编号 2 (2017)
- 页面: 503-505
- 栏目: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225402
- DOI: https://doi.org/10.1134/S1064562417050313
- ID: 225402
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
K. Gorbunov
Kharkevich Institute for Information Transmission Problems
编辑信件的主要联系方式.
Email: gorbunov@iitp.ru
俄罗斯联邦, Moscow, 127051
V. Lyubetsky
Kharkevich Institute for Information Transmission Problems; Mechanics and Mathematics Faculty
Email: gorbunov@iitp.ru
俄罗斯联邦, Moscow, 127051; Moscow, 119991
补充文件
