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

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.

Mots clés: modular decomposition; linear time algorithms

Domaines: Autre [cs.OH]

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⟩