{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:25Z","timestamp":1725488545664},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_19","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:26:17Z","timestamp":1186727177000},"page":"132-139","source":"Crossref","is-referenced-by-count":0,"title":["Generating All Forest Extensions of a Partially Ordered Set"],"prefix":"10.1007","author":[{"given":"Jayme L.","family":"Szwarcfiter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01108590","volume":"12","author":"E. R. Canfield","year":"1995","unstructured":"E. R. Canfield and S. G. Williamson. A loop free algorithm for generating the linear extensions of a poset. ORDER, 12:1\u201318, 1995.","journal-title":"ORDER"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"R. C. Correa and J. L. Szwarcfiter. On extensions, linear extensions, upsets and downsets of ordered sets. Submitted, 2000.","DOI":"10.1016\/S1571-0653(05)80128-3"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0095-8956(83)90049-7","volume":"35","author":"R. E. Jamison","year":"1983","unstructured":"R. E. Jamison. On the average number of nodes in a subtree of a tree. Journal of Combinatorial Theory B, 35:207\u2013223, 1983.","journal-title":"Journal of Combinatorial Theory B"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/0095-8956(84)90046-7","volume":"37","author":"R. E. Jamison","year":"1984","unstructured":"R. E. Jamison. Monotonicity of the mean order of subtrees. Journal of Combinatorial Theory B, 37: 70\u201378, 1984.","journal-title":"Journal of Combinatorial Theory B"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0196-6774(83)90042-1","volume":"4","author":"A. D. Kalvin","year":"1983","unstructured":"A. D. Kalvin and Y. L. Varol. On the generation of topological sortings. Journal of Algorithms, 4:150\u2013162, 1983.","journal-title":"Journal of Algorithms"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(74)90001-5","volume":"2","author":"D. E. Knuth","year":"1974","unstructured":"D. E. Knuth and J. L. Szwarcfiter. A structured program to generate all topological sorting arrangements. Information Processing Letters, 2:153\u2013157, 1974.","journal-title":"Information Processing Letters"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1006\/jagm.1993.1044","volume":"15","author":"Y. Koda","year":"1993","unstructured":"Y. Koda and F. Ruskey. A gray code for the ideals of a forest poset. Journal of Algorithms, 15:324\u2013340, 1993.","journal-title":"Journal of Algorithms"},{"key":"19_CR8","first-page":"305","volume":"16-B","author":"A. Meir","year":"1983","unstructured":"A. Meir and J. W. Moon. On subtrees of certain families of trees. Ars Combinatoria, 16-B:305\u2013318, 1983.","journal-title":"Ars Combinatoria"},{"key":"19_CR9","unstructured":"M. Morvan and L. Nourine. Generating minimal interval extensions. Technical report, Laboratoire d\u2019 Informatique Robotique et Microelectronique, Universite de Montpellier II, 1992. Rapport de Recherche 92-05."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0404037","volume":"4","author":"G. Pruesse","year":"1991","unstructured":"G. Pruesse and F. Ruskey. Generating the linear extensions of certain posets by transpositions. SIAM Journal on Discrete Mathematics, 4:413\u2013422, 1991.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/S0097539791202647","volume":"23","author":"G. Pruesse","year":"1994","unstructured":"G. Pruesse and F. Ruskey. Generating linear extensions fast. SIAM Journal on Computing, 23:373\u2013386, 1994.","journal-title":"SIAM Journal on Computing"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0095-8956(92)90067-8","volume":"54","author":"F. Ruskey","year":"1992","unstructured":"F. Ruskey. Generating linear extensions of posets. Journal of Combinatorial Theory B, 54:77\u2013101, 1992.","journal-title":"Journal of Combinatorial Theory B"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/comjnl\/24.1.83","volume":"24","author":"Y. L. Varol","year":"1981","unstructured":"Y. L. Varol and D. Rotem. An algorithm to generate al topological sorting arrangements. Computer Journal, 24:83\u201384, 1981.","journal-title":"Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:12:26Z","timestamp":1556734346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}