Мақаланы E-mail арқылы жіберу 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
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
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
Қосымша файлдар
