Abstract
A set family is a collection of sets over a universe. If a set family satisfies certain closure properties then it admits an efficient representation of its members by labeled trees. The size of the tree is proportional to the size of the universe, whereas the number of set family members can be exponential. Computing such efficient representations is an important task in algorithm design. Set families are usually not given explicitly (by listing their members) but represented implicitly.
We consider the problem of efficiently computing tree representations of set families. Assuming the existence of efficient algorithms for solving the Membership and Separation problems, we prove that if a set family satisfies weak closure properties then there exists an efficient algorithm for computing a tree representation of the set family. The running time of the algorithm will mainly depend on the running times of the algorithms for the two basic problems. Our algorithm generalizes several previous results and provides a unified approach to the computation for a large class of decompositions of graphs. We also introduce a decomposition notion for directed graphs which has no undirected analogue. We show that the results of the first part of the paper are applicable to this new decomposition. Finally, we give efficient algorithms for the two basic problems and obtain an \({\cal O}(n^3)\)-time algorithm for computing a tree representation.
This work was supported by the Research Council of Norway. The first author was supported by the French National Research Agency, project MAGNUM.
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.
Similar content being viewed by others
References
Bernáth, A.: A note on the directed source location algorithm. Technical report, TR-2004-12, Egerváry Research Group, Budapest (2004)
Bui-Xuan, B.-M.: Tree-representation of set families in graph decompositions and efficient algorithms. PhD thesis, University of Montpellier II (2008)
Bui-Xuan, B.-M., Habib, M.: A representation theorem for union-difference families and application. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 492–503. Springer, Heidelberg (2008)
Bui-Xuan, B.-M., Habib, M., Limouzy, V., de Montgolfier, F.: Algorithmic Aspects of a General Modular Decomposition Theory. Discrete Applied Mathematics 157, 1993–2009 (2009)
Bui-Xuan, B.-M., Habib, M., Rao, M.: Tree-representation of set families and applications to combinatorial decompositions. European Journal of Combinatorics (to appear)
Chein, M., Habib, M., Maurer, M.-C.: Partitive hypergraphs. Discrete Mathematics 37, 35–50 (1981)
Cunningham, W.: A combinatorial decomposition theory. PhD thesis, University of Waterloo (1973)
Cunningham, W., Edmonds, J.: A combinatorial decomposition theory. Canadian Journal of Mathematics 32, 734–765 (1980)
Cunningham, W.: Decomposition of directed graphs. SIAM Journal on Algebraic and Discrete Methods 2, 214–228 (1982)
Dinitz, E., Karzanov, A., Lomonosov, M.: On the structure of a family of minimal weighted cuts in a graph. In: Pridman, A. (ed.) Studies in Discrete Optimization, Nauka, Moscow, pp. 290–306 (1976)
Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Annals of Discrete Mathematics 1, 185–204 (1977)
Gabow, H.: Centroids, Representations, and Submoduar Flows. Journal of Algorithms 18, 586–628 (1995)
Hsu, W.-L., Gabor, C., Supowit, K.: Recognizing circle graphs in polynomial time. Journal of the ACM 36, 435–473 (1989)
de Mongolfier, F., Rao, M.: The bi-join decomposition. Electronic Notes in Discrete Mathematics 22, 173–177 (2005)
Queyranne, M.: Minimizing symmetric submodular functions. Mathematical Programming 82, 3–12 (1998)
Schrijver, A.: Combinatorial Optimization – Polyhedra and Efficiency. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bui-Xuan, BM., Heggernes, P., Meister, D., Proskurowski, A. (2011). A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)