@conference {16415,
	title = {CrossNet: a framework for crossover with network-based chromosomal representations},
	booktitle = {Proceedings of the 10th annual conference on Genetic and evolutionary computation},
	series = {GECCO {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {1057 - 1064},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We propose a new class of crossover operators for genetic algorithms (CrossNet) which use a network-based (or graph-based) chromosomal representation. We designed CrossNet with the intent of providing a framework for creating crossover operators that take advantage of domain-specific knowledge for solving problems. Specifically, GA users supply a network which defines the epistatic relationships between genes in the genotype. CrossNet-based crossover uses this information with the goal of improving linkage. We performed two experiments that compared CrossNet-based crossover with one-point and uniform crossover. The first experiment involved the density classification problem for cellular automata (CA), and the second experiment involved fitting two randomly generated hyperplane-defined functions (hdf{\textquoteright}s). Both of these exploratory experiments support the hypothesis that CrossNet-based crossover can be useful, although performance improvements were modest. We discuss the results and remain hopeful about the successful application of CrossNet to other domains. We conjecture that future work with the CrossNet framework will provide a useful new perspective for investigating linkage and chromosomal representations.},
	keywords = {crossover, Genetic algorithms, graphs, linkage, NETWORKS, recombination},
	isbn = {978-1-60558-130-9},
	doi = {10.1145/1389095.1389290},
	url = {http://doi.acm.org/10.1145/1389095.1389290},
	author = {Stonedahl,Forrest and Rand, William and Wilensky,Uri}
}
@article {15198,
	title = {On computing graph closures},
	journal = {Information Processing Letters},
	volume = {31},
	year = {1989},
	month = {1989/06/12/},
	pages = {249 - 255},
	abstract = {The closure of a graph G of n vertices is obtained from G by recursively joining pairs of non-adjacent vertices whose degree sum is at least n until no such pair remains. We give an efficient algorithm to compute the closure using F-heaps. We also define the general closure of a graph and show that computing the general closure is P-complete with respect to log-space transformations.},
	keywords = {closure, graphs, P-completeness},
	isbn = {0020-0190},
	doi = {10.1016/0020-0190(89)90082-3},
	url = {http://www.sciencedirect.com/science/article/pii/0020019089900823},
	author = {Khuller, Samir}
}
