Analyzing directed acyclic graph recombination

DOI10.1007/3-540-45493-4_72MaRDI QIDQ4448635zbMATH OpenFDO

Authors Carlos Cotta, J. M. Troya

Publication date 18 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2206/22060739.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Random Generation of Directed Acyclic Graphs
• Artificial Evolution
• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• Random generation of essential directed acyclic graphs
• Uniform random generation of large acyclic digraphs

Cited in

(4)

• Information processing in transmitting recombination
• A mathematical design of genetic operators on \(\mathrm{GL}_n(\mathbb Z_2)\)
• scientific article; zbMATH DE number 7301299 (Why is no real title available?)
• Graph decompositions for demographic loop analysis

This page was built for publication: Analyzing directed acyclic graph recombination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448635)