Study of Neural Network Algorithm for Straight-Line Drawings of Planar Graphs

01/21/2014
by   Mohamed A. El-Sayed, et al.
0

Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings. VLSI layouts with fewer crossings are more easily realizable and consequently cheaper. A straight-line drawing of a planar graph G of n vertices is a drawing of G such that each edge is drawn as a straight-line segment without edge crossings. However, a problem with current graph layout methods which are capable of producing satisfactory results for a wide range of graphs is that they often put an extremely high demand on computational resources. This paper introduces a new layout method, which nicely draws internally convex of planar graph that consumes only little computational resources and does not need any heavy duty preprocessing. Here, we use two methods: The first is self organizing map known from unsupervised neural networks which is known as (SOM) and the second method is Inverse Self Organized Map (ISOM).

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/31/2017

On the Edge-length Ratio of Outerplanar Graphs

We show that any outerplanar graph admits a planar straightline drawing ...
08/29/2017

Aligned Drawings of Planar Graphs

Let G be a graph topological embedded in the plane and let A be an arra...
01/03/2022

On Optimal Beyond-Planar Graphs

A graph is beyond-planar if it can be drawn in the plane with a specific...
08/23/2019

Variants of the Segment Number of a Graph

The segment number of a planar graph is the smallest number of line segm...
04/25/2020

Extending Partial 1-Planar Drawings

Algorithmic extension problems of partial graph representations such as ...
08/24/2020

Layered Drawing of Undirected Graphs with Generalized Port Constraints

The aim of this research is a practical method to draw cable plans of co...
08/08/2021

Deep Neural Network for DrawiNg Networks, (DNN)^2

By leveraging recent progress of stochastic gradient descent methods, se...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.