Abstract
We give a quadratic O(|X|2) space representation based on a canonical tree for any subset family 
closed under the union and the difference of its overlapping members. The cardinality of 
is potentially in O(2|X|), and the total cardinality of its members even higher. As far as we know this is the first representation result for such families. As an application of this framework we obtain a unique digraph decomposition that not only captures, but also is strictly more powerful than the well-studied modular decomposition. A polynomial time decomposition algorithm for this case is described.
Research supported by the ANR project Graph Decompositions and Algorithms.
Full version available at http://hal-lirmm.ccsd.cnrs.fr/lirmm-00175766.
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
Bui-Xuan, B.-M., Habib, M., Rao, M.: Representing partitive crossing Families and union-difference Families, with Application to Sesquimodular Decomposition. Available at: http://hal-lirmm.ccsd.cnrs.fr/lirmm-00199916
Capelle, C., Habib, M.: Graph decompositions and factorizing permutations. In: 5th Israel Symposium on Theory of Computing and Systems (ISTCS 1997), pp. 132–143. IEEE Computer Society, Los Alamitos (1997)
Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Mathematics 37(1), 35–50 (1981)
Cohen, D.A., Cooper, M.C., Jeavons, P.G.: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Technical Report CS-RR-06-06, Oxford University (2006)
Crespelle, C.: Représentations dynamiques de graphes. PhD thesis, Université Montpellier II (2007)
Cunningham, W.: Decomposition of directed graphs. SIAM Journal on Algebraic and Discrete Methods 3, 214–228 (1982)
Cunningham, W., Edmonds, J.: A combinatorial decomposition theory. Canadian Journal of Mathematics 32, 734–765 (1980)
Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Annals of Discrete Mathematics 1, 185–204 (1977)
Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-Structures- A Framework for Decomposition and Transformation of Graphs. World Scientific, Singapore (1999)
Everett, M.G., Borgatti, S.P.: Regular Equivalence: General Theory. Journal of Mathematical Sociology 18, 29–52 (1994)
Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theoretical Computer Science 349(1), 67–81 (2005)
Gabow, H.: Centroids, Representations, and Submodular Flows. Journal of Algorithms 18(3), 586–628 (1995)
Gagneur, J., Krause, R., Bouwmeester, T., Casari, G.: Modular decomposition of protein-protein interaction networks. Genome Biology 5(8) (2004)
Gallai, T.: Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungaricae 18, 25–66 (1967)
Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: An interesting algorithmic tool kit. International Journal of Foundations of Computer Science 10(2), 147–170 (1999)
Hsu, W.-L., McConnell, R.M.: PC-trees and circular-ones arrangements. Theoretical Computer Science 296, 99–116 (2003)
Lanlignel, J.-M.: Autour de la décomposition en coupes. PhD thesis, Université Montpellier II (2001)
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)
de Mongolfier, F., Rao, M.: The bi-join decomposition. In: 7th International Colloquium on Graph Theory (ICGT 2005) (2005)
Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Heidelberg (2003)
Semple, C., Steel, M.: Phylogenetics. Oxford Lecture Series in Mathematics and Its Applications, vol. 24 (2003)
White, D.R., Reitz, K.P.: Graph and Semigroup Homomorphisms on Networks of Relations. Social Networks 5, 193–234 (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bui-Xuan, B.M., Habib, M. (2008). A Representation Theorem for Union-Difference Families and Application. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds) LATIN 2008: Theoretical Informatics. LATIN 2008. Lecture Notes in Computer Science, vol 4957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78773-0_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-78773-0_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78772-3
Online ISBN: 978-3-540-78773-0
eBook Packages: Computer ScienceComputer Science (R0)