189 citations · 219 across the 9 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DM2013
On price of symmetrisation
Absil Romain, Hadrien Mélot
We introduce the price of symmetrisation, a concept that aims to compare fundamental differences (gap and quotient) between values of a given graph invariant for digraphs and the v…
cs.DM2013★ 4 cited
Digenes: genetic algorithms to discover conjectures about directed and undirected graphs
Romain Absil, Hadrien Mélot
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 al…