The minimum-cost transformation of graphs
- 15 Downloads
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.
Unable to display preview. Download preview PDF.
- 2.K. Yu. Gorbunov and V. A. Lyubetsky, in CEUR Workshop Proceedings (CEUR-WS.Org): Selected Papers of the First International Scientific Conference Convergent Cognitive Information Technologies (Convergent 2016), Moscow, Russia, 2016 (Moscow, 2016), Vol. 1763, pp. 162–172.Google Scholar
- 8.P. E. C. Compeau, in Proceedings of 14th International Workshop “Algorithms in Bioinformatics,” Wroclaw, Poland, 2014 (Wroclaw, 2014), Vol. 8701, pp. 38–51.Google Scholar