The topological drawing of a graph: Construction methods

Authors:
S. V. Kurapov;A. V. Tolok
Affiliations:
Zaporizhzhya National University, Zaporizhzhya, Ukraine;Moscow State University of Technology (STANKIN), Moscow, Russia
Venue:
Automation and Remote Control
Year:
2013

Citing 7
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Algorithms for drawing graphs: an annotated bibliography

Computational Geometry: Theory and Applications
Drawing graphs: methods and models

Drawing graphs: methods and models
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)
Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications)

Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers construction algorithms for the topological 2-D drawing of a graph. These algorithms allow to store, describe and modify the existing information on the drawing of a graph. Finally, we introduce necessary notions and structures to solve the problem of the topological 2-D drawing of a graph.