Clique Detection via Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

@TechReport{Haynes:1996:CDGb,
  author =       "Thomas Haynes and Dale Schoenefeld",
  title =        "Clique Detection via Genetic Programming",
  number =       "UTULSA-MCS-96-05",
  institution =  "The University of Tulsa",
  month =        mar # " 15,",
  notes =        "Full version of GP'96 poster",
  year =         "1996",
  keywords =     "genetic algorithms, genetic programming",
  broken =       "http://euler.mcs.utulsa.edu/~haynes/clique.ps",
  URL =          "http://citeseer.ist.psu.edu/cache/papers/cs/4146/http:zSzzSzeuler.mcs.utulsa.eduzSz~hayneszSzclique.pdf/haynes95clique.pdf",
  URL =          "http://citeseer.ist.psu.edu/haynes95clique.html",
  abstract =     "Genetic programming is applied to the task of finding
                 all of the cliques in a graph. Nodes in the graph are
                 represented as tree structures, which are then
                 manipulated to form candidate cliques. The intrinsic
                 properties of clique detection complicates the design
                 of a good fitness evaluation. We analyze those
                 properties, and show the clique detector is found to be
                 better at finding the maximum clique in the graph, not
                 the set of all cliques.",
}

Genetic Programming entries for Thomas D Haynes Dale A Schoenefeld

Citations