Photo from archive.org
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… Click to show full abstract
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.
Keywords:
cost transformation;
minimum cost;
transformation graphs
Journal Title: Doklady Mathematics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Doklady Mathematics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!