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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958972
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 4:54:48 PM
Last modification on : Thursday, May 24, 2018 - 3:59:21 PM
Document(s) archivé(s) le : Friday, June 13, 2014 - 12:06:42 PM

File

dm050104.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

154

Files downloads

675