Course pages 2017–18

# Algebraic Path Problems, with applications to Internet Routing

## Lecture slides

- Lectures 1, 2.
- Interesting related links ...
- The number of semigroups of order n
- The number of monoids of order n
- The number of groups of order n
- Lecture 3.
- Lecture 4.
- Homework 1 in Agda, by Bradley Hardy
- Lectures 5 and 6.
- Lectures 7 and 8.
- Lecture 9.
- Lecture 10.
- Lecture 11.
- Lecture 12.
- Lecture 15.

## On reserve in CL library

- Path problems in networks. John S. Baras and George Theodorakopoulos. Morgan and Claypool, 2010.
- Graphs, Dioids and Semirings : New Models and Algorithms, by Michel Gondran , Michel Minoux, 2008

## Reading

- RFC 1058: Routing Information Protocol (RIP). C. Hedrick (1988)
- An Algebra for Network Routing Problems. B. A. CARRÉ (1970).
- Semiring frameworks and algorithms for shortest-distance problems, M. Mohri
- On the Forwarding Paths Produced by Internet Routing Algorithms. Seweryn Dynerowicz (University of Namur, Belgium), Timothy G. Griffin. ICNP 2013.
- A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph. Alberto Martelli. Journal of the ACM (JACM). Volume 23, Issue 1, Jan. 1976.