{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:46:22Z","timestamp":1649029582774},"reference-count":7,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1986]]},"DOI":"10.1051\/ita\/1986200302111","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:59:50Z","timestamp":1486047590000},"page":"211-219","source":"Crossref","is-referenced-by-count":1,"title":["A parametric analysis of the largest induced tree problem in random graphs"],"prefix":"10.1051","volume":"20","author":[{"given":"M.","family":"Protasi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. ERD\u00d6S P. and PALKA Z., Trees in Random Graphs, Discr. Math., Vol 46, 1983.7108850535.05049","DOI":"10.1016\/0012-365X(83)90247-9"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. FRIEDMAN J., Constructing 0 (n log n) size monotone formulae for the k-th elementary symmetric polynomial of n boolean variables, Proc. 25th Symp. on Foundations of Computer Science, 1984.","DOI":"10.1109\/SFCS.1984.715953"},{"key":"R3","unstructured":"3. KARONSKI M. and PALKA Z., On the Size of a Maximal Induced Tree in a Random Graph, Math. Slovaca, Vol. 30, 1980.320155872400438.05028"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. MARCHETTI-SPACCAMELA A. and PROTASI M., The Largest Tree in a Random Graph, Theor. Comp. Sci., Vol. 23, 1983.7020120512.68045","DOI":"10.1016\/0304-3975(83)90034-8"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. PROTASI M. and TALAMO M., A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems, Proc. Conf. on Foundations of Computation Theory, Borgholm, Lect. Notes in Comp. Sci., Vol. 158, 1983.7347340549.68068","DOI":"10.1007\/3-540-12689-9_118"},{"key":"R6","unstructured":"6. PROTASI M. and TALAMO M., A General Analysis of the Max-Independent Set and Related Problems on Random Graphs, Tech. Rep. 3\/84, Dip. Matematica, Universit\u00e0 dell'Aquila, 1984."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. PROTASI M. and TALAMO M., On the Maximum Size of Random Trees, Proc. X Coll. on Trees in Algebra and Programming, Berlin, Lect. Notes in Comp. Sci., Vol. 185, 1985.0576.05014","DOI":"10.1007\/3-540-15198-2_8"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1986200302111\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:56:35Z","timestamp":1568786195000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1986200302111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":7,"journal-issue":{"issue":"3"},"alternative-id":["ita1986200302111"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1986200302111","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]}}}