Weekly Notes for Week 18

• This weeks topics:

  • Integer hyperflows.
  • We will start with Canonicalization.
  • Morgan’s and Ullmann’s algorithm.

• Exercises:

  • Exercise Sheet 02

• Reading Material:

  • Mandatory: Chapter 4 of the PhD thesis by J.L. Andersen
  • Additional handwritten-example article: Hartke and Radcliffe, McKay’s canonical graph labeling algorithm
  • Voluntary classic paper: Brendan D. McKay, Practical Graph Isomorphism (1981)
  • Recommended (voluntary and advanced): McKay, B.D. and Piperno, A., Practical Graph Isomorphism, II, Journal of Symbolic Computation, 60 (2014), pp. 94-112.
  • Link for visualising graph canonicalization as shown in the first lecture: http://jakobandersen.github.io/graph_canon_vis
  • mød documentation (password as usual)

• Additional slides:

  • Morgan slides
  • Ullmann slides
  • Equitable refinement notes