The topological drawing of a graph: construction methods

DOI10.1134/S0005117913090063zbMath1277.05121OpenAlexW1971948648MaRDI QIDQ386927

S. V. Kurapov, A. V. Tolok

Publication date: 11 December 2013

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117913090063

zbMATH Keywords

topological 2-D drawing of a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

EVOLUTIONARILY-FRAGMENTED ALGORITHM FOR FINDING A MAXIMAL FLAT PART OF A GRAPH ⋮ PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) ⋮ Construction of a topological drawing of the most planar subgraph of the non-planar graph

Cites Work

• Algorithms for drawing graphs: An annotated bibliography
• Graph Drawing and Applications for Software and Knowledge Engineers
• Drawing graphs. Methods and models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The topological drawing of a graph: construction methods