Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms
In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are still efficient.
This theory not only unifies the usual modular decomposition generalisations such as modular decomposition of directed graphs and of 2-structures, but also decomposition by star cutsets.
KeywordsDirected Graph Boolean Function Strong Module Submodular Function Maximal Module
Unable to display preview. Download preview PDF.
- 15.Möhring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics 19, 257–356 (1984)Google Scholar