Digenes：发现有向图和无向图的结构的遗传算法
Digenes: genetic algorithms to discover conjectures about directed and undirected graphs
摘要：
我们提出了Digenes，一个新的发现系统，旨在帮助研究人员在图论。虽然它的主要任务是找到一个给定的（功能）不变量的极值图，它也提供了一些基本的支持证明概念。自Caporossi和Hansen的AutoGraphiX系统（Discrete Math.212 -2000）以来，这已经被证明是非常有用的，可以找到新的图形。然而，与现有的系统不同，Digene可以用于有向或无向图。在本文中，我们介绍了Digene的原理和功能，描述了遗传算法，已被设计来实现它们，并给出了一些计算结果和开放的问题。这就引出了一些关于遗传算法设计的有趣问题，如交叉的定义。
英文摘要：
We present Digenes, a new discovery system that aims to help researchers in graph theory. While its main task is to find extremal graphs for a given (function of) invariants, it also provides some basic support in proof conception. This has already been proved to be very useful to find new conjectures since the AutoGraphiX system of Caporossi and Hansen (Discrete Math. 212-2000). However, unlike existing systems, Digenes can be used both with directed or undirected graphs. In this paper, we present the principles and functionality of Digenes, describe the genetic algorithms that have been designed to achieve them, and give some computational results and open questions. This do arise some interesting questions regarding genetic algorithms design particular to this field, such as crossover definition.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
