Path: utzoo!utgpu!jarvis.csri.toronto.edu!neat.cs.toronto.edu!marina
Newsgroups: ont.events
From: marina@ai.toronto.edu (Marina Haloulos)
Subject: Professor Rudi Mathon, Wednesday 22 November 1989: COMBINATORICS & THE
Message-ID: <89Nov13.144301est.2934@neat.cs.toronto.edu>
Date: 13 Nov 89 19:43:25 GMT

           Department of Computer Science, University of Toronto
             (GB = Gailbraith Building, 35 St. George Street)

       -------------------------------------------------------------

                      COMBINATORICS & THEORY SEMINAR
              GB304, at 2:00 p.m., Wednesday 22 November 1989

                           Professor Rudi Mathon
                           University of Toronto

                             "Clique Finding"

A new algorithm will be presented for finding cliques in large graphs.  It
utilizes nested partitions which are determined via simulated annealing.
Examples will be given and applications discussed.