Neural-Networks for Cliques and Coloring

Neural-Networks for Cliques and Coloring

This directory contains codes by Arun Jagota (jagota@ICSI.Berkeley.EDU) and Laura Sanchis (laura@CS.COLGATE.EDU) exploring neural-network approaches to approximate the solution of max-clique and vertex coloring. Implementations in both C and Mathematica are provided, along with associated journal references.
  • Download Files (local site)

    Problem Links

  • Clique (6)
  • Vertex Coloring (6)
  • Vertex Cover (6)
  • Independent Set (5)

    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Aug 26, 1996.