{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:49Z","timestamp":1725664309487},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591757"},{"type":"electronic","value":"9783540492207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59175-3_78","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:04:47Z","timestamp":1330275887000},"page":"16-35","source":"Crossref","is-referenced-by-count":0,"title":["Random generation of colored trees"],"prefix":"10.1007","author":[{"given":"L.","family":"Alonso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Schott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"2_CR1","unstructured":"L. Alonso, J.L. R\u00e9my, R. Schott, A linear time algorithm for the generation of trees, Rapport CRIN 90-R-001 (submitted)."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T. Beyer","year":"1980","unstructured":"T. Beyer, S.M. Hedetniemi, Constant time generation of rooted trees, SIAM J. Comp. 9, 706\u2013712, 1980.","journal-title":"SIAM J. Comp."},{"key":"2_CR3","first-page":"554","volume":"38","author":"E.A. Dinits","year":"1977","unstructured":"E.A. Dinits, M.A. Zaitsev, Algorithms for the generation of nonisomorphic trees, Autom. Remote Control, 38, 554\u2013558, 1977","journal-title":"Autom. Remote Control"},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1093\/comjnl\/28.5.538","volume":"28","author":"M.C. Er","year":"1985","unstructured":"M.C. Er, Enumeration Ordered Trees Lexicographically, The Computer Journal, 28, 5, 538\u2013542, 1985.","journal-title":"The Computer Journal"},{"key":"2_CR5","unstructured":"P. Flajolet, P. Zimmermann, B.V. Cutsem, A calculus for the Random Generation of Combinatorial Structures, TCS, 29 pages, to appear. Also available as Inria Research Report 1830 (anonymous ftp on ftp.inria.fr dir IN-RIA\/ publication\/RR file RR-1830.ps.gz)."},{"key":"2_CR6","unstructured":"D.E. Knuth, The Art of Computer Programming, vol 1, Fundamental Algorithms, Addison Wesley, 1973."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/BF01071214","volume":"15","author":"A.V. Kozima","year":"1975","unstructured":"A.V. Kozima, Coding and generation of nonisomorphic trees, Cybernetics, 15, 645\u2013651, 1975.","journal-title":"Cybernetics"},{"key":"2_CR8","unstructured":"C.L. Liu, Generation of k-ary trees, Rapport INRIA, 27, 1980, Proceedings CAAP'80, 45\u201353, Universit\u00e9 de Lille."},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","volume":"30","author":"A. Meir","year":"1978","unstructured":"A. Meir, J.W. Moon, On the altitude of nodes in random trees, Canad. J. of Math. 30, 997\u20131015, 1978.","journal-title":"Canad. J. of Math."},{"key":"2_CR10","volume-title":"Combinatorial Algorithms","author":"A. Nijenhuis","year":"1978","unstructured":"A. Nijenhuis, H.S. Wilf, Combinatorial Algorithms, second edition, Academic Press, N.Y., 1978.","edition":"second edition"},{"key":"2_CR11","volume-title":"Combinatorial structures and Their Applications","author":"R.C. Read","year":"1970","unstructured":"R.C. Read, How to grow trees, in Combinatorial structures and Their Applications, Gordon and Breach, New-York, 1970."},{"issue":"2","key":"2_CR12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1051\/ita\/1985190201791","volume":"19","author":"J.L. R\u00e9my","year":"1985","unstructured":"J.L. R\u00e9my, Un proc\u00e9d\u00e9 it\u00e9ratif de d\u00e9nombrement d'arbres et son application \u00e0 leur g\u00e9n\u00e9ration al\u00e9atoire, RAIRO, Informatique Th\u00e9orique, 19, 2, 179\u2013195, 1985.","journal-title":"RAIRO, Informatique Th\u00e9orique"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"H.S. Wilf, Combinatorial Algorithms: An Update, CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM Pub.1989.","DOI":"10.1137\/1.9781611970166"},{"key":"2_CR14","first-page":"341","volume-title":"Ranking rooted trees and a graceful application","author":"H.S. Wilf","year":"1986","unstructured":"H.S. Wilf, N.A. Yoshimura, Ranking rooted trees and a graceful application, Proc. Japon-US joint Seminar in Discrete Algorithms and Complexity, June 4\u20136, kyoto Japan, Academic Press, 341\u2013350, 1986."},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0215039","volume":"15","author":"R.A. Wright","year":"1986","unstructured":"R.A. Wright, B.R. Richmond, A. Odlyzko, B.D. McKay, Constant time generation of freetreees, SIAM J. Comput. 15, 540\u2013548, 1986.","journal-title":"SIAM J. Comput."},{"key":"2_CR16","unstructured":"N.A. Yoshimura, Ranking and unranking algorithms for trees and the combinatorial objects, PhD. thesis University of Pennsylvania, 1987."},{"key":"2_CR17","first-page":"63","volume":"10","author":"S. Zaks","year":"1980","unstructured":"S. Zaks, Lexicographic generation of ordered trees, T.C.S., 10, 63\u201382, 1980.","journal-title":"T.C.S."}],"container-title":["Lecture Notes in Computer Science","LATIN '95: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59175-3_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:24:16Z","timestamp":1619573056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59175-3_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591757","9783540492207"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-59175-3_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}