{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T13:26:12Z","timestamp":1748870772459},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709800"},{"type":"electronic","value":"9783540709817"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70981-7_8","type":"book-chapter","created":{"date-parts":[[2007,3,23]],"date-time":"2007-03-23T13:49:52Z","timestamp":1174657792000},"page":"67-74","source":"Crossref","is-referenced-by-count":24,"title":["Random Intersection Graphs and Classification"],"prefix":"10.1007","author":[{"given":"Erhard","family":"Godehardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"Jaworski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katarzyna","family":"Rybarczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0167-9473(96)88919-5","volume":"23","author":"H.-H. Bock","year":"1996","unstructured":"BOCK, H.-H. (1996): Probabilistic Models in Cluster Analysis. Computational Statistics and Data Analysis, 23, 5\u201328.","journal-title":"Computational Statistics and Data Analysis"},{"key":"8_CR2","volume-title":"Graphs as Structural Models","author":"E. Godehardt","year":"1990","unstructured":"GODEHARDT, E. (1990): Graphs as Structural Models. Vieweg, Braunschweig."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<137::AID-RSA9>3.0.CO;2-Y","volume":"9","author":"E. Godehardt","year":"1996","unstructured":"GODEHARDT, E. and JAWORSKI, J. (1996): On the Connectivity of a Random Interval Graph. Random Structures and Algorithms, 9, 137\u2013161.","journal-title":"Random Structures and Algorithms"},{"key":"8_CR4","first-page":"68","volume-title":"Exploratory Data Analysis in Empirical Research","author":"E. Godehardt","year":"2002","unstructured":"GODEHARDT, E. and JAWORSKI, J. (2002): Two Models of Random Intersection Graphs for Classification. In: M. Schwaiger and O. Opitz (Eds.): Exploratory Data Analysis in Empirical Research. Springer, Berlin, 68\u201381."},{"key":"8_CR5","volume-title":"Random Graphs","author":"S. Janson","year":"2001","unstructured":"JANSON, S., \u0141UCZAK, T. and RUCI\u0143SKI, A. (2001): Random Graphs. Wiley, New York."},{"issue":"18","key":"8_CR6","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1016\/j.disc.2006.05.013","volume":"306","author":"J. Jaworski","year":"2006","unstructured":"JAWORSKI, J., KARO\u0143SKI, M. and STARK, D. (2006): The Degree of a Typical Vertex in Generalized Random Intersection Graph Models. Discrete Mathematics, 306,18, 2152\u20132165.","journal-title":"Discrete Mathematics"},{"key":"8_CR7","first-page":"135","volume":"65","author":"J. Jaworski","year":"2002","unstructured":"JAWORSKI, J. and PALKA, Z. (2002): Remarks on a general model of a random digraph. Ars Combinatoria, 65, 135\u2013144.","journal-title":"Ars Combinatoria"},{"key":"8_CR8","first-page":"111","volume":"33","author":"J. Jaworski","year":"1987","unstructured":"JAWORSKI, J. and SMIT, I. (1987): On a Random Digraph. Annals of Discrete Mathematics, 33, 111\u2013127.","journal-title":"Annals of Discrete Mathematics"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M. Karo\u0144ski","year":"1999","unstructured":"KARO\u0143SKI, M., SCHEINERMAN, E.R. and SINGER-COHEN, K.B. (1999): On Random Intersection Graphs: The Subgraph Problem. Combinatorics, Probability and Computing, 8, 131\u2013159.","journal-title":"Combinatorics, Probability and Computing"},{"key":"8_CR10","first-page":"265","volume":"25","author":"W. Kordecki","year":"1985","unstructured":"KORDECKI, W. (1985): On the Connectedness of Random Hypergraphs. Commentaciones Mathematicae, 25, 265\u2013283.","journal-title":"Commentaciones Mathematicae"},{"key":"8_CR11","volume-title":"O pewnych zastosowaniach hipergraf\u00f3w losowych","author":"K. Rybarczyk","year":"2005","unstructured":"RYBARCZYK, K. (2005): O pewnych zastosowaniach hipergraf\u00f3w losowych. MA Thesis, Faculty of Mathematics, Adam Mickiewicz University, Pozna\u0144."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02579445","volume":"5.1","author":"J. Schmidt-Pruzan","year":"1985","unstructured":"SCHMIDT-PRUZAN, J. and SHAMIR, E. (1985): Component Structure in the Evolution of Random Hypergraphs. Combinatorica, 5.1, 81\u201394.","journal-title":"Combinatorica"}],"container-title":["Studies in Classification, Data Analysis, and Knowledge Organization","Advances in Data Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70981-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T06:29:49Z","timestamp":1550298589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70981-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709800","9783540709817"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70981-7_8","relation":{},"ISSN":["1431-8814","2198-3321"],"issn-type":[{"type":"print","value":"1431-8814"},{"type":"electronic","value":"2198-3321"}],"subject":[],"published":{"date-parts":[[2007]]}}}