{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:39:53Z","timestamp":1725896393830},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_22","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"206-217","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial Models for Cooperation Networks"],"prefix":"10.1007","author":[{"given":"Michael","family":"Drmota","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Gittenberger","sequence":"additional","affiliation":[]},{"given":"Reinhard","family":"Kutzelnigg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Rev. Modern Phys.\u00a074(1), 47\u201397 (2002)","journal-title":"Rev. Modern Phys."},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-55251-0_2","volume-title":"CAAP \u201992","author":"F. Bergeron","year":"1992","unstructured":"Bergeron, F., Flajolet, P., Salvy, B.: Varieties of increasing trees. In: Raoult, J.-C. (ed.) CAAP 1992. LNCS, vol.\u00a0581, pp. 24\u201348. Springer, Heidelberg (1992)"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B. Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica\u00a024(1), 5\u201334 (2004)","journal-title":"Combinatorica"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. Random Structures Algorithms\u00a018(3), 279\u2013290 (2001)","journal-title":"Random Structures Algorithms"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Drmota, M., Gittenberger, B., Panholzer, A.: The degree distribution of thickened trees. In: DMTCS Proceedings AI, pp. 149\u2013162 (2008)","DOI":"10.46298\/dmtcs.3561"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P., Odlyzko, A.M.: Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics\u00a03, 216\u2013240 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1-3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(93)90364-Y","volume":"114","author":"P. Flajolet","year":"1993","unstructured":"Flajolet, P., Soria, M.: General combinatorial schemas: Gaussian limit distributions and exponential tails. Discrete Math.\u00a0114(1-3), 159\u2013180 (1993)","journal-title":"Discrete Math."},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.jcta.2006.08.003","volume":"114","author":"M. Kuba","year":"2007","unstructured":"Kuba, M., Panholzer, A.: On the degree distribution of the nodes in increasing trees. J. Combin. Theory Ser. A\u00a0114(4), 597\u2013618 (2007)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/rsa.3240040204","volume":"4","author":"H.M. Mahmoud","year":"1993","unstructured":"Mahmoud, H.M., Smythe, R.T., Szyma\u0144ski, J.: On the structure of random plane-oriented recursive trees and their branches. Random Structures Algorithms\u00a04(2), 151\u2013176 (1993)","journal-title":"Random Structures Algorithms"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/rsa.3240050207","volume":"5","author":"B. Pittel","year":"1994","unstructured":"Pittel, B.: Note on the heights of random recursive trees and random m-ary search trees. Random Structures Algorithms\u00a05(2), 337\u2013347 (1994)","journal-title":"Random Structures Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T18:35:18Z","timestamp":1634150118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}