Abstract
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ trees, the modular decomposition of graphs, certain decompositions of boolean functions, and decompositions that arise on a variety of other combinatorial structures. We describe natural operators on partitive set families, give algebraic identities for manipulating them, and describe efficient algorithms for evaluating them. We use these results to obtain new time bounds for finding the common intervals of a set of permutations, finding the modular decomposition of an edge-colored graph (also known as a two-structure), finding the PQ tree of a matrix when a consecutive-ones arrangement is given, and finding the modular decomposition of a permutation graph when its permutation realizer is given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Benzer, S.: On the topology of the genetic fine structure. Proc. Nat. Acad. Sci. U.S.A. 45, 1607–1620 (1959)
Booth, S., Lueker, S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–379 (1976)
Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Mathematics 37, 35–50 (1981)
Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)
Ehrenfeucht, A., Gabow, H.N., McConnell, R.M., Sullivan, S.J.: An O(n 2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs. Journal of Algorithms 16, 283–294 (1994)
Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, part 2: Representations through labeled tree families. Theoretical Computer Science 70, 305–342 (1990)
Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar. 18, 25–66 (1967)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
Heber, S., Stoye, J.: Finding all common intervals of k permutations. In: CPM, pp. 207–218 (2001)
Hsu, W.L., McConnell, R.M.: PC trees and circular-ones arrangements. Theoretical Computer Science 296, 59–74 (2003)
Landau, G.M., Parida, L., Weimann, O.: Using pq trees for comparative genomics. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 128–143. Springer, Heidelberg (2005)
McConnell, R.M.: Linear-time recognition of circular-arc graphs. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), vol. 42, pp. 386–394 (2001)
McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms SODA2004, vol. 15 (2004) (to appear)
McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics 201(1-3), 189–241 (1999)
McConnell, R.M.: Linear-time recognition of circular-arc graphs. Algorithmica 37, 93–147 (2003)
McConnell, R.M., de Montgolfier, F.: Linear-time modular decomposition of directed graphs. Discrete Applied Mathematics (2005)
McConnell, R.M., Spinrad, J.P.: Construction of probe interval models. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 866–875 (2002)
McMorris, F.R., Wang, C., Zhang, P.: On probe interval graphs. Discrete Applied Mathematics 88, 315–324 (1998)
Möhring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (ed.) Graphs and Order, pp. 41–101. D. Reidel, Boston (1985)
Möhring, R.H.: Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Annals of Operations Research 4, 195–225 (1985)
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)
Sokal, R.R., Michener, C.D.: A statistical method for evaluating systematic relationships. The University of Kansas Scientific Bulletin 38, 1409–1438 (1958)
Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26(2), 290–309 (2000)
Zhang, P.: United states patent: Method of mapping DNA fragments. Technical report (July 2000), Available at http://www.cc.columbia.edu/cu/cie/techlists/patents/5667970.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McConnell, R.M., de Montgolfier, F. (2005). Algebraic Operations on PQ Trees and Modular Decomposition Trees. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_37
Download citation
DOI: https://doi.org/10.1007/11604686_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)