Weekly Notes for Week 18

• This weeks topics:

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

• Reading Material:

  • For Canonicalization : Chapter 4 of the PhD thesis by J.L. Andersen
  • Link for visualising graph canonicalization as shown in the first lecture: http:// jakobandersen.github.io/graph_canon_vis
  • McKay, B.D. and Piperno, A., Practical Graph Isomorphism, II, Journal of Symbolic Computation, 60 (2014), pp.94-112. (voluntary)
  • S. G. Hartke and A. Radcliffe. McKay’s canonical graph labeling algorithm. In Communicating Mathematics, volume 479 of Contemporary Mathematics, pages 99-111. American Mathematical Society, (2009). This article contains the example for the handwritten example I will use.
  • mød documentation (password as usual).