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 simpler approach to sequential linear-time modular decomposition.
https://hal.inria.fr/inria-00072855 Contributor : Rapport de Recherche InriaConnect in order to contact the contributor Submitted on : Wednesday, May 24, 2006 - 11:06:04 AM Last modification on : Friday, February 4, 2022 - 3:33:41 AM Long-term archiving on: : Sunday, April 4, 2010 - 11:25:20 PM
Elias Dahlhaus, Jens Gustedt, Ross M. Mcconnell. Efficient and Practical Algorithms for Sequential Modular Decomposition. [Research Report] RR-3804, INRIA. 1999, pp.23. ⟨inria-00072855⟩