Construction of a Topological Drawing of the Most Planar Subgraph of the Non-planar Graph


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

An algorithm was presented to construct a flat drawing of the non-planar graph. The source for solution of the problem is a set of isometric cycles of the graph, which allows one to reduce the solution to the discrete optimization methods. Consideration was given to the necessary concepts and structures for solution of the problem of constructing a planar topological graph drawing.

作者简介

S. Kurapov

Zaporozhé National University

编辑信件的主要联系方式.
Email: lilili5050@rambler.ru
乌克兰, Zaporozhé

A. Tolok

Trapeznikov Institute of Control Sciences

Email: lilili5050@rambler.ru
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2018