  A module of a graph G is a set of vertices that have the same set of
neighbours outside. Modules of a graphs form a so-called partitive family and
thereby can be represented by a unique tree MD(G), called the modular
decomposition tree. Motivated by the central role of modules in numerous
algorithmic graph theory questions, the problem of efficiently computing MD(G)
has been investigated since the early 70's. To date the best algorithms run in
linear time but are all rather complicated. By combining previous algorithmic
paradigms developed for the problem, we are able to present a simpler
linear-time that relies on very simple data-structures, namely slice
decomposition and sequences of rooted ordered trees.
