Advertisement

Versatile Graph Planarisation via an Artificial Neural Network

  • T. Tambouratzis
Conference paper

Abstract

An artificial neural network which is based on harmony theory has been applied to the graph planarisation problem. The presented artificial neural network is capable of solving both aspects of graph planarisation (creation of the optimally planarised as well as of the maximally planar forms of any graph). Optimal solutions are always produced independent of the complexity or planarity of the original graph; if more than one equally good solutions exist they are produced with the same probability.

Keywords

Artificial Neural Network Simulated Annealing Lower Layer Graph Planarisation Uniqueness Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Smolensky. Information processing in dynamical systems: foundations of harmony theory, volume 1, pages 184–281. MIT Press, Cambridge MA, 1986.Google Scholar

Copyright information

© Springer-Verlag Wien 1998

Authors and Affiliations

  • T. Tambouratzis
    • 1
  1. 1.Institute of Nuclear Technology—Radiation ProtectionNCSR ‘Demokritos’AthensGreece

Personalised recommendations