The topological drawing of a graph: Construction methods

  title={The topological drawing of a graph: Construction methods},
  author={S. V. Kurapov and A. V. Tolok},
  journal={Automation and Remote Control},
  • S. Kurapov, A. Tolok
  • Published 1 September 2013
  • Computer Science, Mathematics
  • Automation and Remote Control
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. 
Construction of a Topological Drawing of the Most Planar Subgraph of the Non-planar Graph
An algorithm was presented to construct a flat drawing of the non-planar graph using a set of isometric cycles of the graph, which allows one to reduce the solution to the discrete optimization methods.
Generating a topological drawing of the flat part of a nonplanar graph
The article proposed a method for constructing a topological drawing of the planar part of a non-planar graph using the methods of structure numbers algebra, based on the set of graph isometric cycles that allows application of discrete optimization methods.


Drawing graphs: methods and models
This paper presents a meta-modelling procedure for graph drawing that automates the very labor-intensive and therefore time-heavy and expensive process of drawing graphs.
Planar Graph Drawing
The book presents the important fundamental theorems and algorithms on planar graph drawing with easy-to-understand and constructive proofs and is suitable for use in advanced undergraduate and graduate level courses on algorithms, graph theory, graph drawing, information visualization and computational geometry.
Isomorphism of Planar Graphs
An algorithm is presented for determining whether or not two planar graphs are isomorphic, if V is the number of vertices in each graph.
Graphs, Networks, and Algorithms
This book presents a meta-analsis of the network simplex algorithm and a section on the five color theorem, which states that the color theorem can be rewritten as a graph representation of a network.
Combinatorial Optimization: Algorithms and Complexity
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient
Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications)
The graph drawing tutorial university of ljubljana and the proceedings of the 27th international symposium on graph.
Map Color Theorem
1. Problems, Illustrations, History.- 1.1.The Four Color Problem.- 1.2. Map Color Theorem.- 1.3. The Thread Problem.- 1.4. Unilateral Surfaces.- 2. Graph Theory.- 2.1. Chromatic Number.- 2.2.
Handbook on Graph Drawing and Visualization
Graph Markup Language (GraphML) Ulrik Brandes, Markus Eiglsperger, Jurgen Lerner, and Christian Pich The Open Graph Drawing Framework (OGDF) Markus Chimani, Carsten Gutwenger, Michael Junger, Gunnar W. Klau, Karsten Klein, and Petra Mutzel GDToolkit Giuseppe Di Battista and Walter Didimo.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge