{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:14:44Z","timestamp":1760170484123},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,7,16]],"date-time":"2008-07-16T00:00:00Z","timestamp":1216166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s00224-008-9131-0","type":"journal-article","created":{"date-parts":[[2008,7,15]],"date-time":"2008-07-15T18:30:15Z","timestamp":1216146615000},"page":"284-300","source":"Crossref","is-referenced-by-count":4,"title":["Bijective Linear Time Coding and Decoding for k-Trees"],"prefix":"10.1007","volume":"46","author":[{"given":"Saverio","family":"Caminiti","sequence":"first","affiliation":[]},{"given":"Emanuele G.","family":"Fusco","sequence":"additional","affiliation":[]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,16]]},"reference":[{"key":"9131_CR1","doi-asserted-by":"crossref","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. J.\u00a0Comb. Theory 6, 200\u2013205 (1969)","journal-title":"J.\u00a0Comb. Theory"},{"key":"9131_CR2","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11, 1\u201321 (1993)","journal-title":"Acta Cybern."},{"key":"9131_CR3","doi-asserted-by":"crossref","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. Theor. Comp. Sci. 209, 1\u201345 (1998)","journal-title":"Theor. Comp. Sci."},{"key":"9131_CR4","series-title":"LNCS","first-page":"339","volume-title":"Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN\u201904)","author":"S. Caminiti","year":"2004","unstructured":"Caminiti, S., Finocchi, I., Petreschi, R.: A unified approach to coding labeled trees. In: Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN\u201904). LNCS, vol.\u00a02976, pp.\u00a0339\u2013348. Springer, Berlin (2004)"},{"issue":"2","key":"9131_CR5","doi-asserted-by":"crossref","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. Theor. Comp. Sci. 382(2), 97\u2013108 (2007)","journal-title":"Theor. Comp. Sci."},{"key":"9131_CR6","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/978-3-540-74450-4_37","volume-title":"Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE\u201907)","author":"S. Caminiti","year":"2007","unstructured":"Caminiti, S., Fusco, E.G., Petreschi, R.: A bijective code for k-trees with linear time encoding and decoding. In: Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE\u201907). LNCS, vol. 4614, pp. 408\u2013420. Springer, Berlin (2007)"},{"key":"9131_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/11533719_27","volume-title":"Proceedings of the 11th International Conference on Computing and Combinatorics (COCOON\u201905)","author":"S. Caminiti","year":"2005","unstructured":"Caminiti, S., Petreschi, R.: String coding of trees with locality and heritability. In: Proceedings of the 11th International Conference on Computing and Combinatorics (COCOON\u201905). LNCS, vol.\u00a03595, pp.\u00a0251\u2013262. Springer, Berlin (2005)"},{"key":"9131_CR8","first-page":"376","volume":"23","author":"A. Cayley","year":"1889","unstructured":"Cayley, A.: A theorem on trees. Q. J. Math. 23, 376\u2013378 (1889)","journal-title":"Q. J. Math."},{"key":"9131_CR9","doi-asserted-by":"crossref","first-page":"9635","DOI":"10.1073\/pnas.87.24.9635","volume":"87","author":"W.Y.C. Chen","year":"1990","unstructured":"Chen, W.Y.C.: A general bijective algorithm for trees. Proc. Nat. Acad. Sci., USA 87, 9635\u20139639 (1990)","journal-title":"Proc. Nat. Acad. Sci., USA"},{"key":"9131_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0097-3165(93)90021-Y","volume":"63","author":"W.Y.C. Chen","year":"1993","unstructured":"Chen, W.Y.C.: A Coding algorithm for R\u00e9nyi trees. J. Comb. Theory A 63, 11\u201325 (1993)","journal-title":"J. Comb. Theory A"},{"key":"9131_CR11","doi-asserted-by":"crossref","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"key":"9131_CR12","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. Numer. 130, 7\u201318 (1998)","journal-title":"Congr. Numer."},{"key":"9131_CR13","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. Bull. Inst. Comb. Appl. 34, 77\u201385 (2002)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"9131_CR14","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 (GECCO\u201900), p.\u00a0754. Las Vegas, Nevada, USA (2000)"},{"issue":"1","key":"9131_CR15","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0097-3165(86)90004-X","volume":"42","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. J.\u00a0Comb. Theory A 42(1), 15\u201330 (1986)","journal-title":"J.\u00a0Comb. Theory A"},{"key":"9131_CR16","first-page":"3","volume":"25","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 Comb.\u00a0B 25, 3\u201330 (1988)","journal-title":"Ars Comb.\u00a0B"},{"issue":"2","key":"9131_CR17","doi-asserted-by":"crossref","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 Math. 1(2), 181\u2013186 (1971)","journal-title":"Discrete Math."},{"key":"9131_CR18","doi-asserted-by":"crossref","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 Math. 13, 1\u201311 (1975)","journal-title":"Discrete Math."},{"key":"9131_CR19","doi-asserted-by":"crossref","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 15, 115\u2013122 (1968)","journal-title":"Mathematika"},{"key":"9131_CR20","unstructured":"Kelmans, A., Pak, I., Postnikov, A.: Tree and forest volumes of graphs. Technical Report, DIMACS 2000-03 (2000)"},{"key":"9131_CR21","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. 22, pp. 135\u2013139 (2005)","DOI":"10.1016\/j.endm.2005.06.024"},{"key":"9131_CR22","doi-asserted-by":"crossref","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-trees. J. Comb. Theory 6, 196\u2013199 (1969)","journal-title":"J. Comb. Theory"},{"key":"9131_CR23","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":"9131_CR24","doi-asserted-by":"crossref","unstructured":"Neville, E.H.: The codifying of tree-structure. In: Proceedings of Cambridge Philosophical Society, vol. 49, pp. 381\u2013385 (1953)","DOI":"10.1017\/S030500410002853X"},{"key":"9131_CR25","unstructured":"Picciotto, S.: How to encode a tree. Ph.D. Thesis, University of California, San Diego (1999)"},{"key":"9131_CR26","first-page":"142","volume":"27","author":"H. Pr\u00fcfer","year":"1918","unstructured":"Pr\u00fcfer, H.: Neuer Beweis eines Satzes \u00fcber Permutationen. Arch. Math. Phys. 27, 142\u2013144 (1918)","journal-title":"Arch. Math. Phys."},{"key":"9131_CR27","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":"9131_CR28","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 Math. 7, 317\u2013322 (1974)","journal-title":"Discrete Math."},{"key":"9131_CR29","volume-title":"Computational Recreations in Mathematica","author":"I. Vardi","year":"1991","unstructured":"Vardi, I.: Computational Recreations in Mathematica. Benjamin-Cummings, Redwood City (1991). Chap. Computing Binomial Coefficients"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9131-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-008-9131-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9131-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T01:19:37Z","timestamp":1588814377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-008-9131-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,16]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9131"],"URL":"https:\/\/doi.org\/10.1007\/s00224-008-9131-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,16]]}}}