Prikl. Diskr. Mat., 2016, Number 2(32), Pages 100–114
This article is cited in 3 scientific papers (total in 3 papers)
Applied Graph Theory
Planarity testing and constructing the topological drawing of a plane graph (DFS)
S. V. Kurapov, M. V. Davidovsky
Zaporizhzhya National University, Zaporizhzhya, Ukraine
In this article we present a new graph planarity testing algorithm along with the construction of mathematical framework used for representing topological drawings of plane graphs. This mathematical framework is based on the notions of graph isometric cycles and rotation of graph vertices. It is shown that the system of isometric cycles of a graph induces the rotation of its vertices for representing topological drawing of the plane graph. In contrast to the classical planarity testing algorithms, e.g. the Hopcroft–Tarjan algorithm, the topological drawing obtained as a result of the proposed algorithm execution is used subsequently for the visualization of the planar graph. Computational complexity of the proposed algorithm is estimated by $\mathrm O(m^2)$, where $m$ is the number of edges in the graph.
graph, planarity, graph visualization, topological graph drawing, graph algorithms, vertices rotation, isometric cycles.
PDF file (1259 kB)
S. V. Kurapov, M. V. Davidovsky, “Planarity testing and constructing the topological drawing of a plane graph (DFS)”, Prikl. Diskr. Mat., 2016, no. 2(32), 100–114
Citation in format AMSBIB
\by S.~V.~Kurapov, M.~V.~Davidovsky
\paper Planarity testing and constructing the topological drawing of a~plane graph (DFS)
\jour Prikl. Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
S. V. Kurapov, A. V. Tolok, “Construction of a topological drawing of the most planar subgraph of the non-planar graph”, Autom. Remote Control, 79:5 (2018), 793–810
A. G. Karpov, V. A. Klemeshev, D. Yu. Kuranov, “Opredelenie rabotosposobnosti sistemy, struktura kotoroi zadana grafom”, Vestn. S.-Peterburg. un-ta. Ser. 10. Prikl. matem. Inform. Prots. upr., 16:1 (2020), 41–49
A. G. Karpov, V. A. Klemeshev, D. Yu. Kuranov, “Determining the ability to work of the system, the structure of which is given using graph”, Vestn. St.-Peterbg. Univ. Ser. 10 Prikl. Mat. Inform. Protsessy, 16:1 (2020), 41–49
|Number of views:|