This specialization course helps the student to deepen his knowledge on problems on graphs and their solutions:
- Counting and enumeration: number of covering trees, number of couplings of a planar graph
- Flow algorithms
- Problems of connection, coupling, assignment, transport