## Efficient and practical algorithms for sequential modular decomposition (1999)

by
Elias Dahlhaus
,
Jens Gustedt
,
Ross M. McConnell

Citations: | 30 - 1 self |

### BibTeX

@TECHREPORT{Dahlhaus99efficientand,

author = {Elias Dahlhaus and Jens Gustedt and Ross M. McConnell},

title = {Efficient and practical algorithms for sequential modular decomposition},

institution = {},

year = {1999}

}

### Years of Citing Articles

### OpenURL

### Abstract

A module of an undirected graph G = (V, E) is a set X of vertices that have the same set of neighbors in V \ X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a practical algorithm with an O(n + m(m;n)) time bound and a variant with a linear time bound.