Skip navigation
The Australian National University

Constructive Enumeration without Isomorphs

Brendan McKay (DCS, ANU)

MSI Computational Mathematics (formerly AdvCom) Seminar Series

DATE: 2006-11-06
TIME: 11:00:00 - 12:00:00
LOCATION: John Dedman Seminar Room G35
CONTACT: JavaScript must be enabled to display this email address.

ABSTRACT:
We consider the problem of exhaustively generating classes of combinatorial objects without isomorphic objects appearing. The two main approaches, orderly generation and canonical augmentation, will be explained. Examples will be given from graph theory and geometry.
BIO:
http://cs.anu.edu.au/~bdm/

Updated:  6 November 2006 / Responsible Officer:  JavaScript must be enabled to display this email address. / Page Contact:  JavaScript must be enabled to display this email address.