Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2018, Issue 5, Pages 24–45 (Mi at15068)  
This article is cited in 1 scientific paper (total in 1 paper)

Linear Systems

Construction of a topological drawing of the most planar subgraph of the non-planar graph

S. V. Kurapova, A. V. Tolokb

a Zaporozhé National University, Zaporozhé, Ukraine
b Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (4506 kB) Citations (1)
References:
PDF
HTML
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.
Keywords: graph, rotation of graph vertices, isometric cycles, planarity, planar part of a graph.
Presented by the member of Editorial Board: P. Yu. Chebotarev

Received: 19.02.2015
English version:
Automation and Remote Control, 2018, Volume 79, Issue 5, Pages 793–810
DOI: https://doi.org/10.1134/S0005117918050028
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: S. V. Kurapov, A. V. Tolok, “Construction of a topological drawing of the most planar subgraph of the non-planar graph”, Avtomat. i Telemekh., 2018, no. 5, 24–45; Autom. Remote Control, 79:5 (2018), 793–810
Citation in format AMSBIB
\Bibitem{KurTol18}
\by S.~V.~Kurapov, A.~V.~Tolok
\paper Construction of a~topological drawing of the most planar subgraph of the non-planar graph
\jour Avtomat. i Telemekh.
\yr 2018
\issue 5
\pages 24--45
\mathnet{http://mi.mathnet.ru/at15068}
\elib{https://elibrary.ru/item.asp?id=35485146}
\transl
\jour Autom. Remote Control
\yr 2018
\vol 79
\issue 5
\pages 793--810
\crossref{https://doi.org/10.1134/S0005117918050028}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000432970000002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85047393570}
Linking options:
  • https://www.mathnet.ru/eng/at15068
  • https://www.mathnet.ru/eng/at/y2018/i5/p24
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:197
    Full-text PDF :60
    References:25
    First page:12
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024