Seminar Details
2019-06-11 (14:00) : Graph generation without isomorphs
At Euler building (room A.002)
Organized by Mathematical Engineering
Speaker :
McKay Brendan (Australian National University)
Abstract :
We consider the problem of exhaustively generating families of graphs in a way that avoids
isomorphic graphs while at the same time requiring very little memory even for very large families.
Such algorithms are important for listing chemical isomers and for many other applications.
As an example we present several algorithms for generating fullerenes (the "buckyball" molecules
made only of carbon atoms).