Digenes: genetic algorithms to discover conjectures about directed and undirected graphs

by   Romain Absil, et al.
University of Mons

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.


page 1

page 2

page 3

page 4


Embedding Directed Graphs in Potential Fields Using FastMap-D

Embedding undirected graphs in a Euclidean space has many computational ...

PHOEG Helps Obtaining Extremal Graphs

Extremal Graph Theory aims to determine bounds for graph invariants as w...

An Overview of Schema Theory

The purpose of this paper is to give an introduction to the field of Sch...

Strong Subgraph k-connectivity

Generalized connectivity introduced by Hager (1985) has been studied ext...

Discovery of Invariants through Automated Theory Formation

Refinement is a powerful mechanism for mastering the complexities that a...

Koopman-based spectral clustering of directed and time-evolving graphs

While spectral clustering algorithms for undirected graphs are well esta...

Lasserre Integrality Gaps for Graph Spanners and Related Problems

There has been significant recent progress on algorithms for approximati...

Please sign up or login with your details

Forgot password? Click here to reset