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

Авторы

  • Tatiana Anatolievna Panyukova
  • Egor Aleksandrovich Savitskiy

Ключевые слова:

cutting process; planar graph; Eulerian trail; algorithm

Аннотация

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.

Загрузки

Опубликован

2018-17-10

Выпуск

Том 17 № 6 (59) (2013): Вестник УГАТУ

Раздел

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