The software for algorithms of ordered enclosing covering constructing for plane graphs

Authors

  • Tatiana Anatolievna Panyukova
  • Egor Aleksandrovich Savitskiy

Keywords:

cutting process; planar graph; Eulerian trail; algorithm

Abstract

This paper represents a review of software for constructing ordered enclosing covering for a plane graph with any number of connected components. The authors present the effective algorithm for optimal solution of the considered problem.

Downloads

Published

2018-17-10

Issue

Vol. 17 No. 6 (59) (2013): Вестник УГАТУ

Section

******************************