{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:09Z","timestamp":1750307889879,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T00:00:00Z","timestamp":1274227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,5,19]]},"DOI":"10.1145\/1822327.1822338","type":"proceedings-article","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T14:35:31Z","timestamp":1279722931000},"page":"84-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Estimation of the number of cliques in a random graph"],"prefix":"10.1145","author":[{"given":"Sonal","family":"Patel","sequence":"first","affiliation":[{"name":"Ryerson University, Toronto, ON, Canada"}]},{"given":"Eric","family":"Harley","sequence":"additional","affiliation":[{"name":"Ryerson University, Toronto, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2010,5,19]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"487","volume-title":"Proc. VLDB '94","author":"Agrawal R.","year":"1994"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Bollobas B. (2001). Random Graphs. Cambridge University Press. Bollobas B. (2001). Random Graphs. Cambridge University Press.","DOI":"10.1017\/CBO9780511814068"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100053056"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_5_1","unstructured":"Garey M. R. and Johnson D. S. (1979). Computers and Intractability. Freeman San Francisco. Garey M. R. and Johnson D. S. (1979). Computers and Intractability. Freeman San Francisco."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.6.487"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760024"},{"volume-title":"5th International Conference on Computer Science and Information Systems, (submitted).","year":"2009","author":"Moallemi K.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01098364"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/125\/1\/012053"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Zaki M. Parthasarathy S. Ogihara M. and. Li W. (1997). New Algorothms for Fast Discovery of Assocoation Rules. American Association for Artificial intelligence. Zaki M. Parthasarathy S. Ogihara M. and. Li W. (1997). New Algorothms for Fast Discovery of Assocoation Rules. American Association for Artificial intelligence.","DOI":"10.1007\/978-1-4615-5669-5_1"}],"event":{"name":"C3S2E '10: C* Conference on Computer Science & Software Engineering","sponsor":["ACM Association for Computing Machinery","BytePress","Concordia University Concordia University"],"location":"Montr\u00e9al Quebec Canada","acronym":"C3S2E '10"},"container-title":["Proceedings of the Third C* Conference on Computer Science and Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1822327.1822338","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1822327.1822338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:16Z","timestamp":1750258036000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1822327.1822338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,19]]},"references-count":12,"alternative-id":["10.1145\/1822327.1822338","10.1145\/1822327"],"URL":"https:\/\/doi.org\/10.1145\/1822327.1822338","relation":{},"subject":[],"published":{"date-parts":[[2010,5,19]]},"assertion":[{"value":"2010-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}