Graph Decompositions and Factorizing Permutations

Abstract : A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here for modular decomposition and we propose a linear algorithm that computes the whole decomposition tree when a factorizing permutation is provided. This algorithm can be seen as a common generalization of Ma and Hsu for modular decomposition of chordal graphs and Habib, Huchard and Spinrad for inheritance graphs decomposition. It also suggests many new decomposition algorithms for various notions of graph decompositions.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.55-70
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00958972
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 16:54:48
Dernière modification le : jeudi 11 janvier 2018 - 06:14:31
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:06:42

Fichier

dm050104.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00958972, version 1

Collections

Citation

Christian Capelle, Michel Habib, Fabien Montgolfier. Graph Decompositions and Factorizing Permutations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.55-70. 〈hal-00958972〉

Partager

Métriques

Consultations de la notice

107

Téléchargements de fichiers

273