BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-76-550
       ENTRY:: July 04, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Finding a maximum independent set
        TYPE:: Technical Report
      AUTHOR:: Tarjan, Robert Endre
      AUTHOR:: Trojanowski, Anthony E.
        DATE:: June 1976
       PAGES:: 23
    ABSTRACT:: We present an algorithm which finds a maximum independent set
               in an n-vertex graph in 0($2^{n/3}$) time. The algorithm can
               thus handle graphs roughly three times as large as could be
               analyzed using a naive algorithm.
       NOTES:: [Adminitrivia V1/Prg/19950704]
         END:: STAN//CS-TR-76-550