{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:55:43Z","timestamp":1743058543856,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_176","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:35Z","timestamp":1461269015000},"page":"891-894","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hamilton Cycles in Random Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Charilaos","family":"Efthymiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"176_CR81","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N Alon","year":"2000","unstructured":"Alon N, Spencer JH (2000) The probabilistic method, 2nd edn. Wiley, New York","edition":"2"},{"key":"176_CR82","unstructured":"Efthymiou C, Spirakis PG (2005) On the existence of Hamilton cycles in random intersection graphs. In: Proceedings of the 32nd ICALP. LNCS, vol 3580. Springer, Berlin\/Heidelberg, pp 690\u2013701"},{"key":"176_CR83","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<156::AID-RSA3>3.0.CO;2-H","volume":"16","author":"JA Fill","year":"2000","unstructured":"Fill JA, Scheinerman ER, Singer-Cohen KB (2000) Random intersection graphs when m = \u03c9(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Struct Algorithms 16:156\u2013176","journal-title":"Random Struct Algorithms"},{"key":"176_CR84","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski M, Scheinerman ER, Singer-Cohen K (1999) On random intersection graphs: the subgraph problem. Comb Probab Comput 8:131\u2013159","journal-title":"Comb Probab Comput"},{"key":"176_CR85","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","volume":"43","author":"J Koml\u00f3s","year":"1983","unstructured":"Koml\u00f3s J, Szemer\u00e9di E (1983) Limit distributions for the existence of Hamilton cycles in a random graph. Discret Math 43:55\u201363","journal-title":"Discret Math"},{"key":"176_CR86","first-page":"17","volume":"31","author":"AD Korshunov","year":"1977","unstructured":"Korshunov AD (1977) Solution of a problem of P. Erd\u00f6s and A. R\u00e9nyi on Hamilton cycles in non-oriented graphs. Metody Diskr Anal Teoriy Upr Syst Sb Trubov Novosibrirsk 31:17\u201356","journal-title":"Metody Diskr Anal Teoriy Upr Syst Sb Trubov Novosibrirsk"},{"key":"176_CR87","doi-asserted-by":"crossref","unstructured":"Nikoletseas S, Raptopoulos C, Spirakis P (2007) Expander properties and the cover time of random intersection graphs. In: Proceedings of the 32nd MFCS. Springer, Berlin\/Heidelberg, pp 44\u201355","DOI":"10.1007\/978-3-540-74456-6_6"},{"key":"176_CR88","doi-asserted-by":"crossref","unstructured":"Nikoletseas S, Raptopoulos C, Spirakis P (2004) The existence and efficient construction of large independent sets in general random intersection graphs. In: Proceedings of the 31st ICALP. LNCS, vol 3142. Springer, Berlin\/Heidelberg, pp 1029\u20131040","DOI":"10.1007\/978-3-540-27836-8_86"},{"key":"176_CR89","unstructured":"Singer K (1995) Random intersection graphs. PhD thesis, The Johns Hopkins University, Baltimore"},{"key":"176_CR810","unstructured":"Spirakis PG, Raptopoulos C (2005) Simple and efficient greedy algorithms for Hamilton cycles in random intersection graphs. In: Proceedings of the 16th ISAAC. LNCS, vol 3827. Springer, Berlin\/Heidelberg, pp 493\u2013504"},{"key":"176_CR811","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/rsa.20005","volume":"24","author":"D Stark","year":"2004","unstructured":"Stark D (2004) The vertex degree distribution of random intersection graphs. Random Struct Algorithms 24:249\u2013258","journal-title":"Random Struct Algorithms"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:10:09Z","timestamp":1553098209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_176","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}