Clique Detection via Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.7954
- @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 algorithms, genetic programming",
-
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.",
-
URL = "http://cognet.mit.edu/sites/default/files/books/9780262315876/pdfs/9780262315876_chap65.pdf",
-
URL = "http://cognet.mit.edu/library/books/view?isbn=0262611279",
-
notes = "GP-96 see also technical report Haynes:1995:CDGb",
- }
Genetic Programming entries for
Thomas D Haynes
Dale A Schoenefeld
Citations