1.5.2 Independent Set

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A graph G=(V,E) .

Problem: What is the largest subset of vertices of V such that no pair of vertices defines an edge of E ?

Implementations

  • DIMACS Implementation Challenges (FORTRAN) (rating 7)
  • Neural-Networks for Cliques and Coloring (C) (rating 5)

    Related Problems

  • Clique
  • Set Packing
  • Vertex Coloring
  • Vertex Cover

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .