Course of Combinatorial Optimization and Graph Theory, ORCO

Slides :

  • Flows (pdf)

  • Push-Relabel Algorithm (pdf), Execution of the Push-Relabel Algorithm (pdf)

  • Matchings in bipartite graphs (pdf), Execution of the Hungarian Method (pdf)

  • Matchings in general graphs (pdf), Execution of Edmonds' Algorithm (pdf)

  • Matroids (pdf)

  • Applications of submodular functions (pdf)

    Papers to be presented in this order:

  • Henriksen, Maufrand: How to orient the edges of a graph (pdf)

  • Clavelin, Medusa: On the orientations of graphs (pdf)

  • Gottlieb, Ohama: Graph orientations with edge-connection and parity constraints (pdf)

  • Cantaloube, De Guibert: On the orientation of graphs and hypergraphs (pdf)

  • Arnaud, Mazeyrat: On disjoint trees and arborescences (pdf)

  • Dubery, Heidmann: Increasing the rooted-connectivity of a digraph by one (pdf)

  • Amoura, Delépine: Conservative weightings and ear-decompositions of graphs (pdf)

  • Daniel, Paoli: Note on the path-matching formula (pdf)