Résumé
Modular decomposition arises in different topics of combinatorics, e.g. graph theory. This decomposition is a powerful description tool for discrete objects. It is also used as a preliminary step of many algorithms.<br /><br />This dissertation deals with the algorithmic aspects of modular decomposition. Although linear time algorithms have been published in the mid 90's, the research on that problem still continue on. We survey the advances and techniques recently developped.