IGFE NET 7333

MSc

PostGraduate

Master of Science

Anglais

2,5

21

Technical issues underlying a design of network infrastructure and protocols are formulated as their theoretical models. An algorithmic approach to be used to solve these modeling problems has to be based upon their theoretical analysis. The course presents commonly used problem models as graph coloring, Steiner tree, packing, partitioning, etc. together with their complexity analysis. It introduces the algorithmic approaches recommended: greedy, flow, random, Monte-Carlo etc. Algorithms are given in their technological context, i.e. taking into account computing time, signaling overhead, CAPEX/OPEX, resource availability, etc.

Foundations of the graph theory

Fiche mise à jour le 07/09/2015