Abstract
Let P and P′ be partially ordered sets, with ground set E, |E| = n, and relation sets R and R′, respectively. Say that P′ is an extension of P when \( R \subseteq R^\prime \) . A partially ordered set is a forest when the set of ancestors of any given element forms a chain. We describe an algorithm for generating the complete set of forest extensions of an order P. The algorithm requires O(n 2) time between the generation of two consecutive forests. The initialization of the algorithm requires O(n|R|) time.
Partially supported by the Conselho Nacional de Desenvolvimento Científico e Tecnológico, CNPq, and Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro, FAPERJ, Brasil.
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
E. R. Canfield and S. G. Williamson. A loop free algorithm for generating the linear extensions of a poset. ORDER, 12:1–18, 1995.
R. C. Correa and J. L. Szwarcfiter. On extensions, linear extensions, upsets and downsets of ordered sets. Submitted, 2000.
R. E. Jamison. On the average number of nodes in a subtree of a tree. Journal of Combinatorial Theory B, 35:207–223, 1983.
R. E. Jamison. Monotonicity of the mean order of subtrees. Journal of Combinatorial Theory B, 37: 70–78, 1984.
A. D. Kalvin and Y. L. Varol. On the generation of topological sortings. Journal of Algorithms, 4:150–162, 1983.
D. E. Knuth and J. L. Szwarcfiter. A structured program to generate all topological sorting arrangements. Information Processing Letters, 2:153–157, 1974.
Y. Koda and F. Ruskey. A gray code for the ideals of a forest poset. Journal of Algorithms, 15:324–340, 1993.
A. Meir and J. W. Moon. On subtrees of certain families of trees. Ars Combinatoria, 16-B:305–318, 1983.
M. Morvan and L. Nourine. Generating minimal interval extensions. Technical report, Laboratoire d’ Informatique Robotique et Microelectronique, Universite de Montpellier II, 1992. Rapport de Recherche 92-05.
G. Pruesse and F. Ruskey. Generating the linear extensions of certain posets by transpositions. SIAM Journal on Discrete Mathematics, 4:413–422, 1991.
G. Pruesse and F. Ruskey. Generating linear extensions fast. SIAM Journal on Computing, 23:373–386, 1994.
F. Ruskey. Generating linear extensions of posets. Journal of Combinatorial Theory B, 54:77–101, 1992.
Y. L. Varol and D. Rotem. An algorithm to generate al topological sorting arrangements. Computer Journal, 24:83–84, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szwarcfiter, J.L. (2003). Generating All Forest Extensions of a Partially Ordered Set. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_19
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive