Homogeneity vs Adjacency: generalising some graph decomposition algorithms
<|reference_start|>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 or decomposition of 2-structures, but also star cutsets and bimodular decomposition. Our general framework provides a decomposition algorithm which improves the best known algorithms for bimodular decomposition.<|reference_end|>
@article{xuan2006homogeneity,
    title={Homogeneity vs. Adjacency: generalising some graph decomposition
  algorithms},
    author={Binh Minh Bui Xuan (LIRMM), Michel Habib (LIAFA), Vincent Limouzy
  (LIAFA), Fabien De Montgolfier (LIAFA)},
    journal={Graph-Theoretic Concepts in Computer Science Springer (Ed.)
  (22/06/2006) 278-288},
    year={2006},
    doi={10.1007/11917496\_25},
    archivePrefix={arXiv},
    eprint={cs/0603048},
    primaryClass={cs.DS}
}