Abstract:
For weighted directed chain-cycle graphs, an algorithm transforming one graph into another is constructed. The algorithm runs in linear time and yields a sequence of transformations with the smallest, up to an additive error, total cost. The costs of the operations of inserting and deleting an edge segment may differ from each other and from the costs of the other operations. The additive error is estimated in terms of the operation costs.