The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

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 (5)
    Vertex Coloring (5)
    Vertex Cover (5)
    Independent Set (4)


    This page last modified on 2008-07-10 .
    www.algorist.com