Lectures

NICE: An open source alternative to nauty which computes the automorphism group of a graph and determines whether two graphs are isomorphic. This talk, given in the SAGE seminar, is a brief explanation of how the algorithm works.

The SAGE Graph Class: This talk, given at SAGE Days 3 (IPAM UCLA), is an introduction to the features of graphs in SAGE. Note that substantially more features have been added to the class since the talk, in particular NICE, an imporved database, optimized spring layout, 3d plotting, etc.

The State of Graph Theory Software: The correct date for this talk is actually October 10, 2006. It is the result of an extensive survey of existing graph theory software and some initial benchmarks. Here is a list of related links.

Generating Doubly Even Codes: Discusses the combinatorial generation of (self orthogonal) doubly even linear error correcting codes using distributed computing. See this classification of some small-parameter doubly even codes.