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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

S. V. Kurapov

Zaporozhé National University

Author for correspondence.
Email: lilili5050@rambler.ru
Ukraine, Zaporozhé

A. V. Tolok

Trapeznikov Institute of Control Sciences

Email: lilili5050@rambler.ru
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Pleiades Publishing, Ltd.