{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T13:27:57Z","timestamp":1747834077209},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_5","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T09:09:19Z","timestamp":1372756159000},"page":"29-35","source":"Crossref","is-referenced-by-count":4,"title":["A Guided Tour in Random Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Paul G.","family":"Spirakis","sequence":"first","affiliation":[]},{"given":"Sotiris","family":"Nikoletseas","sequence":"additional","affiliation":[]},{"given":"Christoforos","family":"Raptopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1137\/050647153","volume":"23","author":"M. Behrisch","year":"2008","unstructured":"Behrisch, M., Taraz, A., Ueckerdt, M.: Coloring random intersection graphs and complex networks. SIAM J. Discrete Math.\u00a023, 288\u2013299 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Cooper, C., Frieze, A.: The Cover Time of Sparse Random Graphs. In: Random Structures and Algorithms, vol.\u00a030, pp. 1\u201316. John Wiley & Sons, Inc. (2007)","DOI":"10.1002\/rsa.20151"},{"issue":"40-42","key":"5_CR3","doi-asserted-by":"publisher","first-page":"3714","DOI":"10.1016\/j.tcs.2010.06.022","volume":"411","author":"C. Efthymiou","year":"2010","unstructured":"Efthymiou, C., Spirakis, P.G.: Sharp thresholds for Hamiltonicity in random intersection graphs. Theor. Comput. Sci.\u00a0411(40-42), 3714\u20133730 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"5_CR4","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":"J.A. Fill","year":"2000","unstructured":"Fill, J.A., Sheinerman, E.R., Singer-Cohen, K.B.: Random intersection graphs when m\u2009=\u2009\u03c9(n): an equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Struct. Algorithms\u00a016(2), 156\u2013176 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0012-365X(90)90149-C","volume":"81","author":"A. Frieze","year":"1990","unstructured":"Frieze, A.: On the Independence Number of Random Graphs. Disc. Math.\u00a081, 171\u2013175 (1990)","journal-title":"Disc. Math."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Godehardt, E., Jaworski, J.: Two models of Random Intersection Graphs for Classification. In: Opitz, O., Schwaiger, M. (eds.). Studies in Classification, Data Analysis and Knowledge Organisation, pp. 67\u201382. Springer, Heidelberg (2002)","DOI":"10.1007\/978-3-642-55721-7_8"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M. Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski, M., Sheinerman, E.R., Singer-Cohen, K.B.: On Random Intersection Graphs: The Subgraph Problem. Combinatorics, Probability and Computing Journal\u00a08, 131\u2013159 (1999)","journal-title":"Combinatorics, Probability and Computing Journal"},{"issue":"1","key":"5_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01375472","volume":"11","author":"T. \u0141uczak","year":"2005","unstructured":"\u0141uczak, T.: The chromatic number of random graphs. Combinatorica\u00a011(1), 45\u201354 (2005)","journal-title":"Combinatorica"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-03816-7_51","volume-title":"Mathematical Foundations of Computer Science 2009","author":"S. Nikoletseas","year":"2009","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: Coloring Non-sparse Random Intersection Graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 600\u2013611. Springer, Heidelberg (2009)"},{"issue":"50","key":"5_CR10","doi-asserted-by":"publisher","first-page":"5261","DOI":"10.1016\/j.tcs.2009.08.028","volume":"410","author":"S. Nikoletseas","year":"2009","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: Expander properties and the cover time of random intersection graphs. Theor. Comput. Sci.\u00a0410(50), 5261\u20135272 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.tcs.2008.06.047","volume":"406","author":"S. Nikoletseas","year":"2008","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: Large independent sets in general random intersection graphs. Theor. Comput. Sci.\u00a0406, 215\u2013224 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-642-32589-2_63","volume-title":"Mathematical Foundations of Computer Science 2012","author":"S. Nikoletseas","year":"2012","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 728\u2013739. Springer, Heidelberg (2012)"},{"issue":"48","key":"5_CR13","doi-asserted-by":"publisher","first-page":"6750","DOI":"10.1016\/j.tcs.2011.09.003","volume":"412","author":"S. Nikoletseas","year":"2011","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.G.: On the Independence Number and Hamiltonicity of Uniform Random Intersection Graphs. Theor. Comput. Sci.\u00a0412(48), 6750\u20136760 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method. Springer (2002)","DOI":"10.1007\/978-3-642-04016-0"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/11602613_50","volume-title":"Algorithms and Computation","author":"C. Raptopoulos","year":"2005","unstructured":"Raptopoulos, C., Spirakis, P.G.: Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 493\u2013504. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/rsa.20356","volume":"38","author":"K. Rybarczyk","year":"2011","unstructured":"Rybarczyk, K.: Equivalence of a random intersection graph and G(n, p). Random Structures and Algorithms\u00a038(1-2), 205\u2013234 (2011)","journal-title":"Random Structures and Algorithms"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Shang, Y.: On the Isolated Vertices and Connectivity in Random Intersection Graphs. International Journal of Combinatorics\u00a02011, Article ID 872703 (2011), doi:10.1155\/2011\/872703","DOI":"10.1155\/2011\/872703"},{"key":"5_CR18","unstructured":"Singer-Cohen, K.B.: Random Intersection Graphs. PhD thesis, John Hopkins University (1995)"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/rsa.20005","volume":"24","author":"D. Stark","year":"2004","unstructured":"Stark, D.: The vertex degree distribution of random intersection graphs. Random Structures & Algorithms\u00a024(3), 249\u2013258 (2004)","journal-title":"Random Structures & Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:36:53Z","timestamp":1557898613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}