The graph coloring problem: A neuronal network approach

Abstract

Solution of an optimization problem with linear constraints through the continuous Hopfield network (CHN) is based on an energy or Lyapunov function that decreases as the system evolves until a local minimum value is attained. This approach is extended in to optimization problems with quadratic constraints. As a particular case, the graph coloring problem (GCP) is analyzed. The mapping procedure and an appropriate parameter-setting procedure are detailed. To test the theoretical results, some computational experiments solving the GCP are shown. 2007 Elsevier B.V. All rights reserved.

Topics

    1 Figures and Tables

    Download Full PDF Version (Non-Commercial Use)