An improved neural network model for the two-page crossing number problem

The simplest graph drawing method is that of putting the vertices of a graph on a line and drawing the edges as half-circles either above or below the line. Such drawings are called 2-page book drawings. The smallest number of crossings over all 2-page drawings of a graph G is called the 2-page cros...

Full description

Saved in:
Bibliographic Details
Main Authors: Hongmei He, Ondrej Sykora, Erkki Makinen
Format: Default Article
Published: 2006
Subjects:
Other information and computing sciences not elsewhere classified
2-page crossing number
Hopfield model
Energy function
Motion equation
Learning algorithms
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/2382
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items