{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:15Z","timestamp":1725501075525},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_37","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T01:49:24Z","timestamp":1189734564000},"page":"408-420","source":"Crossref","is-referenced-by-count":1,"title":["A Bijective Code for k-Trees with Linear Time Encoding and Decoding"],"prefix":"10.1007","author":[{"given":"Saverio","family":"Caminiti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele G.","family":"Fusco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0021-9800(69)80120-1","volume":"6","author":"L.W. Beineke","year":"1969","unstructured":"Beineke, L.W., Pippert, R.E.: On the Number of k-Dimensional Trees. Journal of Combinatorial Theory\u00a06, 200\u2013205 (1969)","journal-title":"Journal of Combinatorial Theory"},{"key":"37_CR2","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A Tourist Guide Through Treewidth. Acta Cybernetica\u00a011, 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A Partial k-Arboretum of Graphs with Bounded Treewidth. Theoretical Computer Science\u00a0209, 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-3-540-24698-5_38","volume-title":"LATIN 2004: Theoretical Informatics","author":"S. Caminiti","year":"2004","unstructured":"Caminiti, S., Finocchi, I., Petreschi, R.: A Unified Approach to Coding Labeled Trees. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 339\u2013348. Springer, Heidelberg (2004)"},{"key":"37_CR5","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":"37_CR6","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":"37_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W.Y.C.: A general bijective algorithm for trees. In: Proceedings of the National Academy of Science, vol.\u00a087, pp. 9635\u20139639 (1990)","DOI":"10.1073\/pnas.87.24.9635"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0097-3165(93)90021-Y","volume":"63A","author":"W.Y.C. Chen","year":"1993","unstructured":"Chen, W.Y.C.: A Coding Algorithm for R\u00e9nyi Trees. Journal of Combinatorial Theory\u00a063A, 11\u201325 (1993)","journal-title":"Journal of Combinatorial Theory"},{"key":"37_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 the Institute of Combinatorics and its Applications (ICA)\u00a034, 77\u201385 (2002)","journal-title":"Bulletin of the Institute of Combinatorics and its Applications (ICA)"},{"issue":"1","key":"37_CR10","doi-asserted-by":"crossref","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.B.: Bijections for Cayley Trees, Spanning Trees, and Their q-Analogues. Journal of Combinatorial Theory\u00a042A(1), 15\u201330 (1986)","journal-title":"Journal of Combinatorial Theory"},{"key":"37_CR11","first-page":"3","volume":"25B","author":"\u00d6. E\u011fecio\u011flu","year":"1988","unstructured":"E\u011fecio\u011flu, \u00d6., Shen, L.P.: A Bijective Proof for the Number of Labeled q-Trees. Ars Combinatoria\u00a025B, 3\u201330 (1988)","journal-title":"Ars Combinatoria"},{"issue":"2","key":"37_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(71)90023-9","volume":"1","author":"D. Foata","year":"1971","unstructured":"Foata, D.: Enumerating k-Trees. Discrete Mathematics\u00a01(2), 181\u2013186 (1971)","journal-title":"Discrete Mathematics"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(75)90082-5","volume":"13","author":"C. Greene","year":"1975","unstructured":"Greene, C., Iba, G.A.: Cayley\u2019s Formula for Multidimensional Trees. Discrete Mathematics\u00a013, 1\u201311 (1975)","journal-title":"Discrete Mathematics"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1112\/S002557930000245X","volume":"15","author":"F. Harary","year":"1968","unstructured":"Harary, F., Palmer, E.M.: On Acyclic Simplicial Complexes. Mathematika\u00a015, 115\u2013122 (1968)","journal-title":"Mathematika"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Markenzon, L., Costa Pereira, P.R., Vernet, O.: The Reduced Pr\u00fcfer Code for Rooted Labelled k-Trees. In: Proceedings of 7th International Colloquium on Graph Theory. Electronic Notes in Discrete Mathematics, vol.\u00a022, pp. 135\u2013139 (2005)","DOI":"10.1016\/j.endm.2005.06.024"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0021-9800(69)80119-5","volume":"6","author":"J.W. Moon","year":"1969","unstructured":"Moon, J.W.: The Number of Labeled k\u2009\u2212Trees. Journal of Combinatorial Theory\u00a06, 196\u2013199 (1969)","journal-title":"Journal of Combinatorial Theory"},{"key":"37_CR17","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":"37_CR18","doi-asserted-by":"crossref","unstructured":"Neville, E.H.: The Codifying of Tree-Structure. In: Proceedings of Cambridge Philosophical Society, vol.\u00a049, pp. 381\u2013385 (1953)","DOI":"10.1017\/S030500410002853X"},{"key":"37_CR19","unstructured":"Picciotto, S.: How to Encode a Tree. PhD thesis, University of California, San Diego (1999)"},{"key":"37_CR20","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":"37_CR21","first-page":"945","volume-title":"Combinatorial Theory and its Applications","author":"A. R\u00e9nyi","year":"1970","unstructured":"R\u00e9nyi, A., R\u00e9nyi, C.: The Pr\u00fcfer Code for k-Trees. In: Erd\u00f6s, P., et al. (eds.) Combinatorial Theory and its Applications, pp. 945\u2013971. North-Holland, Amsterdam (1970)"},{"key":"37_CR22","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"D.J. Rose","year":"1974","unstructured":"Rose, D.J.: On Simple Characterizations of k-Trees. Discrete Mathematics\u00a07, 317\u2013322 (1974)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:28:14Z","timestamp":1619504894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}