Skip to Main content Skip to Navigation
New interface
Journal articles

Efficient and Practical Algorithms for Sequential Modular Decomposition

Elias Dahlhaus Jens Gustedt 1 Ross M. Mcconnell 
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Résumé : 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. || Un module d'un graphe non-orienté G=(V,E) est un ensemble X de sommets qui partage le même ensemble de voisins en V \ X. La décomposition modulaire est une décomposition unique des sommets en modules emboîtés. Nous donnons une approche simplifiée à la
Document type :
Journal articles
Complete list of metadata
Contributor : Jens Gustedt Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:51:54 PM
Last modification on : Friday, February 4, 2022 - 3:30:52 AM


  • HAL Id : inria-00100822, version 1



Elias Dahlhaus, Jens Gustedt, Ross M. Mcconnell. Efficient and Practical Algorithms for Sequential Modular Decomposition. Journal of Algorithms in Cognition, Informatics and Logic, 2001, 41 (2), pp.360-387. ⟨inria-00100822⟩



Record views