Skip to Main content Skip to Navigation
Journal articles

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
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, March 13, 2014 - 4:54:48 PM
Last modification on : Friday, August 5, 2022 - 10:32:14 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:06:42 PM


Files produced by the author(s)




Christian Capelle, Michel Habib, Fabien De Montgolfier. Graph Decompositions and Factorizing Permutations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, Vol. 5, pp.55-70. ⟨10.46298/dmtcs.298⟩. ⟨hal-00958972⟩



Record views


Files downloads