{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T05:03:05Z","timestamp":1766466185447},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_38","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"339-348","source":"Crossref","is-referenced-by-count":8,"title":["A Unified Approach to Coding Labeled Trees"],"prefix":"10.1007","author":[{"given":"Saverio","family":"Caminiti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irene","family":"Finocchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"38_CR1","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0218035","volume":"18","author":"M.J. Atallah","year":"1989","unstructured":"Atallah, M.J., Cole, R., Goodrich, M.T.: Cascading divide-and-conquer: a technique for designing parallel algorithms. SIAM Journal of Computing\u00a018(3), 499\u2013532 (1989)","journal-title":"SIAM Journal of Computing"},{"key":"38_CR2","first-page":"376","volume":"23","author":"A. Cayley","year":"1889","unstructured":"Cayley, A.: A theorem on trees. Quarterly Journal of Mathematics\u00a023, 376\u2013378 (1889)","journal-title":"Quarterly Journal of Mathematics"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s002249910006","volume":"33","author":"H.C. Chen","year":"2000","unstructured":"Chen, H.C., Wang, Y.L.: An efficient algorithm for generating Pr\u00fcfer codes from labelled trees. Theory of Computing Systems\u00a033, 97\u2013105 (2000)","journal-title":"Theory of Computing Systems"},{"key":"38_CR4","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. McGraw-Hill, New York (2001)"},{"key":"38_CR5","first-page":"77","volume":"34","author":"N. Deo","year":"2002","unstructured":"Deo, N., Micikevicius, P.: A new encoding for labeled trees employing a stack and a queue. Bulletin of the Institute of Combinatorics and its Applications\u00a034, 77\u201385 (2002)","journal-title":"Bulletin of the Institute of Combinatorics and its Applications"},{"key":"38_CR6","first-page":"65","volume":"151","author":"N. Deo","year":"2001","unstructured":"Deo, N., Micikevicius, P.: Pr\u00fcfer-like codes for labeled trees. Congressus Numerantium\u00a0151, 65\u201373 (2001)","journal-title":"Congressus Numerantium"},{"key":"38_CR7","unstructured":"Deo, N., Micikevicius, P.: Parallel algorithms for computing Pr\u00fcfer-like codes of labeled trees. Computer Science Technical Report CS-TR-01-06 (2001)"},{"key":"38_CR8","first-page":"754","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"W. Edelson","year":"2000","unstructured":"Edelson, W., Gargano, M.L.: Feasible encodings for GA solutions of constrained minimal spanning tree problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, p. 754. Morgan Kaufmann Publishers, San Francisco (2000)"},{"key":"38_CR9","unstructured":"Greenlaw, R., Halldorsson, M.M., Petreschi, R.: On computing Pr\u00fcfer codes and their corresponding trees optimally. In: Proceedings Journees de l\u2019Informatique Messine, Graph algorithms (2000)"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0166-218X(99)00221-8","volume":"102","author":"R. Greenlaw","year":"2000","unstructured":"Greenlaw, R., Petreschi, R.: Computing Pr\u00fcfer codes efficiently in parallel. Discrete Applied Mathematics\u00a0102, 205\u2013222 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"38_CR11","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1137\/S0097539799352449","volume":"31","author":"Y. Han","year":"1852","unstructured":"Han, Y., Shen, X.: Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMS. SIAM Journal of Computing\u00a031(6), 1852\u20131878 (1852)","journal-title":"SIAM Journal of Computing"},{"key":"38_CR12","volume-title":"An Introduction to parallel algorithms","author":"J. J\u00e1j\u00e1","year":"1992","unstructured":"J\u00e1j\u00e1, J.: An Introduction to parallel algorithms. Addison Wesley, Reading (1992)"},{"key":"38_CR13","unstructured":"Kelmans, A., Pak, I., Postnikov, A.: Tree and forest volumes of graphs. DIMACS Technical Report 2000-03 (2000)"},{"key":"38_CR14","first-page":"7","volume":"130","author":"V. Kumar","year":"1998","unstructured":"Kumar, V., Deo, N., Kumar, N.: Parallel generation of random trees and connected graphs. Congressus Numerantium\u00a0130, 7\u201318 (1998)","journal-title":"Congressus Numerantium"},{"key":"38_CR15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1080\/10637199408915406","volume":"2","author":"W.T. Lo","year":"1994","unstructured":"Lo, W.T., Peng, S.: The optimal location of a structured facility in a tree network. Journal of Parallel Algorithms and Applications\u00a02, 43\u201360 (1994)","journal-title":"Journal of Parallel Algorithms and Applications"},{"key":"38_CR16","volume-title":"Counting labeled trees","author":"J.W. Moon","year":"1970","unstructured":"Moon, J.W.: Counting labeled trees. William Clowes and Sons, London (1970)"},{"key":"38_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1017\/S030500410002853X","volume":"49","author":"E.H. Neville","year":"1953","unstructured":"Neville, E.H.: The codifying of tree structures. Proceedings of Cambridge Philosophical Society\u00a049, 381\u2013385 (1953)","journal-title":"Proceedings of Cambridge Philosophical Society"},{"key":"38_CR18","first-page":"142","volume":"27","author":"H. Pr\u00fcfer","year":"1918","unstructured":"Pr\u00fcfer, H.: Neuer Beweis eines Satzes \u00fcber Permutationen. Archiv f\u00fcr Mathematik und Physik\u00a027, 142\u2013144 (1918)","journal-title":"Archiv f\u00fcr Mathematik und Physik"},{"issue":"12","key":"38_CR19","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1109\/71.640015","volume":"8","author":"Y.L. Wang","year":"1997","unstructured":"Wang, Y.L., Chen, H.C., Liu, W.K.: A parallel algorithm for constructing a labeled tree. IEEE Transactions on Parallel and Distributed Systems\u00a08(12), 1236\u20131240 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F","volume":"30","author":"G. Zhou","year":"1997","unstructured":"Zhou, G., Gen, M.: A note on genetic algorithms for degree-constrained spanning tree problems. Networks\u00a030, 91\u201395 (1997)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T12:07:05Z","timestamp":1553342825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}