Optimal Eulerian coverings with ordered enclosing for plane graphs

One of the optimal criteria for sequences of trails with ordered enclosing is the length of additional segments between the end of current trail and the beginning of the next one. Known algorithms for constructing such the covering do not consider this criterion. This paper is devoted to an algorithm for constructing of Eulerian covering with ordered enclosing and minimal value of indicated criterion. Ill. 1, bibliogr. 12.