{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:36:27Z","timestamp":1743068187374,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642019692"},{"type":"electronic","value":"9783642019708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01970-8_60","type":"book-chapter","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T18:26:23Z","timestamp":1242757583000},"page":"611-620","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel Algorithms for Dandelion-Like Codes"],"prefix":"10.1007","author":[{"given":"Saverio","family":"Caminiti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Boppana, V., Hartanto, I., Fuchs, W.: Full Fault Dictionary Storage Based on Labeled Tree Encoding. In: IEEE VTS 1996, pp. 174\u2013179 (1996)","DOI":"10.1109\/VTEST.1996.510854"},{"key":"60_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/11549468_68","volume-title":"Euro-Par 2005 Parallel Processing","author":"V. Garg","year":"2005","unstructured":"Garg, V., Agarwal, A.: Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol.\u00a03648, pp. 606\u2013616. Springer, Heidelberg (2005)"},{"key":"60_CR3","first-page":"7","volume":"130","author":"N. Deo","year":"1998","unstructured":"Deo, N., Kumar, N., Kumar, V.: Parallel Generation of Random Trees and Connected Graphs. Congr. Num.\u00a0130, 7\u201318 (1998)","journal-title":"Congr. Num."},{"key":"60_CR4","volume-title":"Genetic Algorithms: A Guide to GA Theory","author":"C. Reeves","year":"2003","unstructured":"Reeves, C., Rowe, J.: Genetic Algorithms: A Guide to GA Theory. Springer, Heidelberg (2003)"},{"key":"60_CR5","first-page":"376","volume":"23","author":"A. Cayley","year":"1889","unstructured":"Cayley, A.: A Theorem on Trees. Quart. J. Math.\u00a023, 376\u2013378 (1889)","journal-title":"Quart. J. Math."},{"key":"60_CR6","first-page":"142","volume":"27","author":"H. Pr\u00fcfer","year":"1918","unstructured":"Pr\u00fcfer, H.: Neuer Beweis eines Satzes \u00fcber Permutationen. Archiv der Mathematik und Physik\u00a027, 142\u2013144 (1918)","journal-title":"Archiv der Mathematik und Physik"},{"key":"60_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11533719_27","volume-title":"Computing and Combinatorics","author":"S. Caminiti","year":"2005","unstructured":"Caminiti, S., Petreschi, R.: String Coding of Trees with Locality and Heritability. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 251\u2013262. Springer, Heidelberg (2005)"},{"key":"60_CR8","unstructured":"Chen, W.: A General Bijective Algorithm for Increasing Trees. Syst. Sci. Math. Sci. 12, 194\u2013203 (1999)"},{"key":"60_CR9","first-page":"77","volume":"34","author":"N. Deo","year":"2002","unstructured":"Deo, N., Micikevi\u010dius, P.: A New Encoding for Labeled Trees Employing a Stack and a Queue. Bulletin of ICA\u00a034, 77\u201385 (2002)","journal-title":"Bulletin of ICA"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0097-3165(86)90004-X","volume":"42A","author":"\u00d6. E\u011fecio\u011flu","year":"1986","unstructured":"E\u011fecio\u011flu, \u00d6., Remmel, J.: Bijections for Cayley Trees, Spanning Trees, and Their q-Analogues. J. Comb. Th.\u00a042A, 15\u201330 (1986)","journal-title":"J. Comb. Th."},{"key":"60_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(91)90138-R","volume":"87","author":"G. Kreweras","year":"1991","unstructured":"Kreweras, G., Moszkowski, P.: Tree codes that preserve increases and degree sequences. J. Disc. Math.\u00a087, 291\u2013296 (1991)","journal-title":"J. Disc. Math."},{"key":"60_CR12","volume-title":"Counting Labeled Trees","author":"J. Moon","year":"1970","unstructured":"Moon, J.: Counting Labeled Trees. William Clowes and Sons, London (1970)"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Neville, E.: The Codifying of Tree-Structure. In: Proc. of Cambridge Philosophical Soc., vol.\u00a049, pp. 381\u2013385 (1953)","DOI":"10.1017\/S030500410002853X"},{"key":"60_CR14","unstructured":"Picciotto, S.: How to Encode a Tree. PhD thesis, U. California, San Diego (1999)"},{"key":"60_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2007.03.009","volume":"382","author":"S. Caminiti","year":"2007","unstructured":"Caminiti, S., Finocchi, I., Petreschi, R.: On Coding Labeled Trees. TCS\u00a0382, 97\u2013108 (2007)","journal-title":"TCS"},{"key":"60_CR16","first-page":"65","volume":"183","author":"S. Caminiti","year":"2006","unstructured":"Caminiti, S., Deo, N., Micikevi\u010dius, P.: Linear-time Algorithms for Encoding Trees as Sequences of Node Labels. Congr. Num.\u00a0183, 65\u201375 (2006)","journal-title":"Congr. Num."},{"key":"60_CR17","first-page":"97","volume":"33","author":"H. Chen","year":"2000","unstructured":"Chen, H., Wang, Y.: An Efficient Algorithm for Generating Pr\u00fcfer Codes from Labelled Trees. TCS\u00a033, 97\u2013105 (2000)","journal-title":"TCS"},{"key":"60_CR18","unstructured":"Deo, N., Micikevi\u010dius, P.: Parallel Algorithms for Computing Pr\u00fcfer-Like Codes of Labeled Trees. Technical report, CS-TR-01-06, Department of Computer Science, University of Central Florida, Orlando (2001)"},{"key":"60_CR19","unstructured":"Greenlaw, R., Halld\u00f3rsson, M., Petreschi, R.: On Computing Pr\u00fcfer Codes and Their Corresponding Trees Optimally in Parallel. In: JIM 2000 (2000)"},{"key":"60_CR20","doi-asserted-by":"crossref","unstructured":"Caminiti, S.: On Coding Labeled Trees. PhD thesis, Sapienza U. of Rome (2007)","DOI":"10.1016\/j.tcs.2007.03.009"},{"key":"60_CR21","doi-asserted-by":"crossref","unstructured":"Paulden, T., Smith, D.: Recent advances in the study of the dandelion code, happy code, and blob code spanning tree representations. In: IEEE CEC 2006, pp. 2111\u20132118 (2006)","DOI":"10.1109\/CEC.2006.1688567"},{"key":"60_CR22","unstructured":"Gottlieb, J., Julstrom, B., Raidl, G., Rothlauf, F.: Pr\u00fcfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search. In: GECCO 2001, pp. 343\u2013350 (2001)"},{"key":"60_CR23","doi-asserted-by":"crossref","unstructured":"Wen, X., Vishkin, U.: PRAM-on-Chip: First Commitment to Silicon. In: ACM SPAA 2007, pp. 301\u2013302 (2007)","DOI":"10.1145\/1248377.1248427"},{"key":"60_CR24","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)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2009"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01970-8_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T15:53:08Z","timestamp":1739116388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-01970-8_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019692","9783642019708"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01970-8_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}