Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. Journal of Automata, Languages and Combinatorics 8(2), 117–144 (2003)
Bioch, J.: The complexity of modular decomposition of boolean functions. Discrete Applied Mathematics 149(1-3), 1–13 (2005)
Bui Xuan, B.-M., Habib, M., Paul, C.: Revisiting T. Uno and M. Yagiura’s Algorithm. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 146–155. Springer, Heidelberg (2005)
Capelle, C., Habib, M., de Montgolfier, F.: Graph decomposition and factorizing permutations. D.M.T.C.S. 5(1), 55–70 (2002)
Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Mathematics 37(1), 35–50 (1981)
Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787. Springer, Heidelberg (1994)
Dahlhaus, E.: Parallel algorithms for hierarchical clustering, and applications to split decomposition and parity graph recognition. Journal of Algorithms 36(2), 205–240 (2000)
Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. Journal of Algorithms 41(2), 360–387 (2001)
Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures. Theoretical Computer Science 3(70), 277–342 (1990)
Fujishige, S.: Submodular Functions and Optimization. North-Holland, Amsterdam (1991)
Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar. 18, 25–66 (1967)
Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: An interesting algorithmic tool kit. I.J.F.C.S. 10(2), 147–170 (1999)
McConnell, R.M., de Montgolfier, F.: Linear-time modular decomposition of directed graphs. Discrete Applied Mathematics 145(2), 189–209 (2005)
McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Maths. 201, 189–241 (1999); Extended abstract at SODA 1994
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)
Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973–989 (1987)
Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26(2), 290–309 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xuan, B.M.B., Habib, M., Limouzy, V., de Montgolfier, F. (2006). Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. In: Fomin, F.V. (eds) Graph-Theoretic Concepts in Computer Science. WG 2006. Lecture Notes in Computer Science, vol 4271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11917496_25
Download citation
DOI: https://doi.org/10.1007/11917496_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48381-6
Online ISBN: 978-3-540-48382-3
eBook Packages: Computer ScienceComputer Science (R0)