Graph Decompositions and Factorizing Permutations (1997)
| Venue: | Discrete Mathematics and Theoretical Computer Science |
| Citations: | 8 - 5 self |
BibTeX
@INPROCEEDINGS{Capelle97graphdecompositions,
author = {Christian Capelle and Michel Habib},
title = {Graph Decompositions and Factorizing Permutations},
booktitle = {Discrete Mathematics and Theoretical Computer Science},
year = {1997},
pages = {132--143},
publisher = {IEEE}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A factorizing permutation of a given undirected 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 [9, 8] for modular decomposition of chordal graphs and Habib, Huchard and Spinrad [7] for inheritance graphs decomposition. It also suggests many new decomposition algorithms for various notions of graph decompositions.
