Geodesic
Optimal Eulerian coverings with ordered enclosing for plane graphs
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 2, pp. 64-74

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: plane graph, trail, covering, path, ordered enclosing. 
@article{DA_2011_18_2_a5,
     author = {T. A. Panyukova},
     title = {Optimal {Eulerian} coverings with ordered enclosing for plane graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {64--74},
     publisher = {mathdoc},
     volume = {18},
     number = {2},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2011_18_2_a5/}
}
TY  - JOUR
AU  - T. A. Panyukova
TI  - Optimal Eulerian coverings with ordered enclosing for plane graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2011
SP  - 64
EP  - 74
VL  - 18
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2011_18_2_a5/
LA  - ru
ID  - DA_2011_18_2_a5
ER  - 
%0 Journal Article
%A T. A. Panyukova
%T Optimal Eulerian coverings with ordered enclosing for plane graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2011
%P 64-74
%V 18
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2011_18_2_a5/
%G ru
%F DA_2011_18_2_a5
T. A. Panyukova. Optimal Eulerian coverings with ordered enclosing for plane graphs. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 2, pp. 64-74. http://geodesic.mathdoc.fr/item/DA_2011_18_2_a5/