Options d'inscription
The general goal of this course
To understand graph-based problem modeling and to be familiar with basic algorithms used in task scheduling, the lowest cost computing, computer networks, and optimal path searching.
Learning goals
- Modeling problems with oriented and non-oriented graphs
- Problem solving using particular graphs (bipartite, planar, etc.)
- Minimum spanning tree computing
- Solving scheduling problems
- Finding the shortest path in a graph
- Finding maximum flow in transport network
- Enseignant: Toufik BENOUHIBA