Geodesic
The software for constructing a graph covering with ordered enclosing for multiconnected planar graphs
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, Tome 2 (2013) no. 2, pp. 111-117

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

The problems of constructing such paths that correspond to definite restrictions have practical roots. For example, graph can present a cutting plan for cutting problem. A path covering all the edges of this graph determines the trajectory of cutting tool moving. The paper concerns the algorithm for constructing the optimal cover for any (may be multiconnected) graph by trails with ordered enclosing. This algorithm allows to find such a trajectory of cutting tool moving that a part cut off from a sheet does not require additional cuttings. It is shown that the considered algorithm has polynomial complexity.
Keywords: path, ordered enclosing, plane graph. 
@article{VYURV_2013_2_2_a9,
     author = {T. A. Panyukova and E. A. Savitskiy},
     title = {The software for constructing a graph covering with ordered enclosing for multiconnected planar graphs},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a Vy\v{c}islitelʹna\^a matematika i informatika},
     pages = {111--117},
     publisher = {mathdoc},
     volume = {2},
     number = {2},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURV_2013_2_2_a9/}
}
TY  - JOUR
AU  - T. A. Panyukova
AU  - E. A. Savitskiy
TI  - The software for constructing a graph covering with ordered enclosing for multiconnected planar graphs
JO  - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika
PY  - 2013
SP  - 111
EP  - 117
VL  - 2
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VYURV_2013_2_2_a9/
LA  - ru
ID  - VYURV_2013_2_2_a9
ER  - 
%0 Journal Article
%A T. A. Panyukova
%A E. A. Savitskiy
%T The software for constructing a graph covering with ordered enclosing for multiconnected planar graphs
%J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika
%D 2013
%P 111-117
%V 2
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VYURV_2013_2_2_a9/
%G ru
%F VYURV_2013_2_2_a9
T. A. Panyukova; E. A. Savitskiy. The software for constructing a graph covering with ordered enclosing for multiconnected planar graphs. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, Tome 2 (2013) no. 2, pp. 111-117. http://geodesic.mathdoc.fr/item/VYURV_2013_2_2_a9/