{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:32Z","timestamp":1725663272163},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540126898"},{"type":"electronic","value":"9783540386827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12689-9_118","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:52:44Z","timestamp":1330192364000},"page":"360-367","source":"Crossref","is-referenced-by-count":4,"title":["A new probabilistic model for the study of algorithmic properties of random graph problems"],"prefix":"10.1007","author":[{"given":"Marco","family":"Protasi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"D. Angluin, L.G. Valiant \u201cFast probabilistic algorithms for hamiltonian paths and matchings\u201d, J. Comp. Syst. Sci, Vol. 18 (1979)","DOI":"10.1016\/0022-0000(79)90045-X"},{"key":"30_CR2","volume-title":"Graph theory. An Introductory course","author":"B. Bollobas","year":"1979","unstructured":"B. Bollobas \u201cGraph theory. An Introductory course\u201d Springer Verlag, New York (1979)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"B. Bollobas, P. Erd\u00f6s \u201cCliques in random graphs\u201d Math. Proc. Camb. Phil. Soc., Vol. 80 (1976)","DOI":"10.1017\/S0305004100053056"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"V.L. Chung \u201cA course in probability theory\u201d Academic Press (1974)","DOI":"10.1007\/978-1-4757-3973-2_2"},{"key":"30_CR5","unstructured":"P. Erd\u00f6s, A. Renyi \u201cOn the evolution of random graphs\u201d Publ. Math. Inst. Hungar. Acad. Sci., Vol. 5 (1960)"},{"key":"30_CR6","volume-title":"Computers and intractability. A guide o the theory of NP-completeness","author":"M.R. Garey","year":"1978","unstructured":"M.R. Garey, D.S. Johnson \u201cComputers and intractability. A guide o the theory of NP-completeness', Freeman, San Francisco, 1978)."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"G. R. Grimmett, C. J. H. Mc Diarmid \u201cOn colouring random graphs\u201d Math. Proc. Camb. Phil. Soc. Vol 77, (1975).","DOI":"10.1017\/S0305004100051124"},{"key":"30_CR8","volume-title":"Algorithms and complexity: New directions and recent results","author":"R. M. Karp","year":"1976","unstructured":"R. M. Karp \u201cThe probabilistic analysis of some combinatorial search algorithms\u201d In J. F. Tranb (ed.) \u201cAlgorithms and complexity: New directions and recent results\u201d, Academic Press, New York (1976)"},{"key":"30_CR9","unstructured":"A.D. Korshunov \u201cSolution of a problem of Erd\u00f6s and Renyi on Hamiltonian cycles in nonoriented graphs\u201d Soviet. Mat. Doklady, Vol. 17 (1976)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"R.M. Karp, M. Sipser \u201cMaximum matchings in sparse random graphs\u201d Proc. 22th Ann. Symp. on Foundations of Computer Science, I EEE Computer Society (1981)","DOI":"10.1109\/SFCS.1981.21"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"L. Posa \u201cHamiltonian circuits in random graphs\u201d Discr. Math., Vol. 14, (1976)","DOI":"10.1016\/0012-365X(76)90068-6"},{"key":"30_CR12","unstructured":"C. Papadimitriou, D. Steiglitz \u201cCombinatorial optimization. Algorithms and complexity\u201d Prentice Hall (1982)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12689-9_118.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:57Z","timestamp":1605643557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12689-9_118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540126898","9783540386827"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-12689-9_118","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}