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.

翻译：图G的模是指一组顶点，它们在外部具有相同的邻居集合。图的模构成所谓的分划族，因此可以用一棵唯一的树MD(G)来表示，称为模分解树。由于模在许多算法图论问题中的核心作用，自20世纪70年代初以来，人们一直在研究高效计算MD(G)的问题。迄今为止，最好的算法在线性时间内运行，但都相当复杂。通过结合为该问题开发的先前算法范式，我们能够提出一种更简单的线性时间算法，该算法依赖于非常简单的数据结构，即切片分解和根有序树序列。