Algorithmic Aspects of a General Modular Decomposition Theory - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

Algorithmic Aspects of a General Modular Decomposition Theory

Résumé

A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs, the terminology ``module'' not only captures the classical graph modules but also allows to handle 2-connected components, star-cutsets, and other vertex subsets. The main result is that most of the nice algorithmic tools developed for modular decomposition of graphs still apply efficiently on our generalisation of modules. Besides, when an essential axiom is satisfied, almost all the important properties can be retrieved. For this case, an algorithm given by Ehrenfeucht, Gabow, McConnell and Sullivan 1994 is generalised and yields a very efficient solution to the associated decomposition problem.
Fichier principal
Vignette du fichier
dam06.pdf (331.13 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00111235 , version 1 (04-11-2006)
hal-00111235 , version 2 (20-11-2007)

Identifiants

Citer

Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier. Algorithmic Aspects of a General Modular Decomposition Theory. 2007. ⟨hal-00111235v2⟩
173 Consultations
303 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More