The minimum-cost transformation of graphs


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

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

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2017