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
Contributeur : Rapport de Recherche Inria
<>
Soumis le : mercredi 24 mai 2006 - 11:06:04
Dernière modification le : dimanche 20 mai 2018 - 20:20:10
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:25:20
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〉
