Clique Detection via Genetic Programming   [GP]

by

Haynes, T. and Schoenefeld, D.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Genetic Programming 1996: Proceedings of the First Annual Conference (Conference proceedings), 1996, p. 426
Keywords:Genetic Programming, Genetic Algorithms
Abstract:
Genetic programming [GP] 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. [FE] We analyze those properties, and show the clique detector is found to be better at finding the maximum clique [MC] in the graph, not the set of all cliques.
Notes:
GP-96 see also technical report Haynes:1995:CDGb
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{haynes:1996:cdGP,
  author =       "Thomas Haynes and Dale Schoenefeld",
  title =        "Clique Detection via Genetic Programming",
  booktitle =    "Genetic Programming 1996: Proceedings of the First
                 Annual Conference",
  editor =       "John R. Koza and David E. Goldberg and David B. Fogel
                 and Rick L. Riolo",
  year =         "1996",
  month =        "28--31 " # jul,
  keywords =     "Genetic Programming, Genetic Algorithms",
  pages =        "426",
  address =      "Stanford University, CA, USA",
  publisher_address = "Cambridge, MA, USA",
  publisher =    "MIT Press",
  size =         "1 page",
  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.",
  notes =        "GP-96 see also technical report Haynes:1995:CDGb",
}