The minimum-cost transformation of graphs
- Autores: Gorbunov K.Y.1, Lyubetsky V.A.1,2
-
Afiliações:
- Kharkevich Institute for Information Transmission Problems
- Mechanics and Mathematics Faculty
- Edição: Volume 96, Nº 2 (2017)
- Páginas: 503-505
- Seção: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225402
- DOI: https://doi.org/10.1134/S1064562417050313
- ID: 225402
Citar
Resumo
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.
Sobre autores
K. Gorbunov
Kharkevich Institute for Information Transmission Problems
Autor responsável pela correspondência
Email: gorbunov@iitp.ru
Rússia, Moscow, 127051
V. Lyubetsky
Kharkevich Institute for Information Transmission Problems; Mechanics and Mathematics Faculty
Email: gorbunov@iitp.ru
Rússia, Moscow, 127051; Moscow, 119991
Arquivos suplementares
