A Hopfield neural network model for the outerplanar crossing number problem

In the outerplanar (other alternate concepts are circular or one-page) drawing, one places vertices of a n-vertex m-edge connected graph G along a circle, and the edges are drawn as straight lines. The minimal number of crossings over all outerplanar drawings of the graph G is called the outerplanar...

Full description

Saved in:
Bibliographic Details
Main Authors: Hongmei He, Ondrej Sykora
Format: Default Text
Published: 2006
Subjects:
Other information and computing sciences not elsewhere classified
outerplanar crossing number
Hopfield model
energy function
motion equation
learning algorithms
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/2379
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items