{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:34Z","timestamp":1750307254365,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T00:00:00Z","timestamp":1289174400000},"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,11,8]]},"DOI":"10.1145\/1967486.1967578","type":"proceedings-article","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T12:01:35Z","timestamp":1302609695000},"page":"598-602","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Computation non-intensive estimation algorithm for counting cycles in random networks"],"prefix":"10.1145","author":[{"given":"Ibrahim","family":"Sorkhoh","sequence":"first","affiliation":[{"name":"Kuwait University, Safat"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Mahdi","sequence":"additional","affiliation":[{"name":"Kuwait University, Safat"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maytham","family":"Safar","sequence":"additional","affiliation":[{"name":"Kuwait University, Safat"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,11,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"290","volume":"195","author":"Erd\u0151s P.","unstructured":"Erd\u0151s , P. and A. R\u00e9nyi , On random graphs. Publicationes Mathematicae , 195 9. 6: p. 290 -- 297 . Erd\u0151s, P. and A. R\u00e9nyi, On random graphs. Publicationes Mathematicae, 1959. 6: p. 290--297.","journal-title":"Publicationes Mathematicae"},{"key":"e_1_3_2_1_2_1","volume":"200","author":"Mahdi K. A.","unstructured":"Mahdi , K. A. , et al. , Cycle-Based versus Degree-based Classification of Social Networks. Journal of Digital Information Management , 200 9. 7(6). Mahdi, K. A., et al., Cycle-Based versus Degree-based Classification of Social Networks. Journal of Digital Information Management, 2009. 7(6).","journal-title":"Journal of Digital Information Management"},{"key":"e_1_3_2_1_3_1","first-page":"333","volume":"200","author":"Mahdi K.","unstructured":"Mahdi , K. , M. Safar , and H. Farahat , Analysis of Temporal Evolution of Social Networks. Journal of Mobile Multimedia , 200 9. 5(4): p. 333 -- 350 . Mahdi, K., M. Safar, and H. Farahat, Analysis of Temporal Evolution of Social Networks. Journal of Mobile Multimedia, 2009. 5(4): p. 333--350.","journal-title":"Mobile Multimedia"},{"key":"e_1_3_2_1_4_1","volume-title":"Entropy of Robust Social Networks. in IADIS International Conference e-Society.","author":"Mahdi K.","year":"2008","unstructured":"Mahdi , K. , M. Safar , and I. Sorkhoh . Entropy of Robust Social Networks. in IADIS International Conference e-Society. 2008 . Algarve, Portugal. Mahdi, K., M. Safar, and I. Sorkhoh. Entropy of Robust Social Networks. in IADIS International Conference e-Society. 2008. Algarve, Portugal."},{"key":"e_1_3_2_1_5_1","volume-title":"IADIS International Conference e-Society.","author":"Mahdi K.","year":"2009","unstructured":"Mahdi , K. , M. Safar , and S. Torabi . A Model of Diffusion Parameter Characterizing Social Networks . in IADIS International Conference e-Society. 2009 . Mahdi, K., M. Safar, and S. Torabi. A Model of Diffusion Parameter Characterizing Social Networks. in IADIS International Conference e-Society. 2009."},{"key":"e_1_3_2_1_6_1","volume-title":"Maximum Entropy of Fully Connected Social Network. in IADIS International Conference Web Based Communities.","author":"Safar M.","year":"2008","unstructured":"Safar , M. , K. Mahdi , and I. Sorkhoh . Maximum Entropy of Fully Connected Social Network. in IADIS International Conference Web Based Communities. 2008 . Amsterdam, Holland. Safar, M., K. Mahdi, and I. Sorkhoh. Maximum Entropy of Fully Connected Social Network. in IADIS International Conference Web Based Communities. 2008. Amsterdam, Holland."},{"key":"e_1_3_2_1_7_1","volume-title":"Enumeration of the Elementary Circuits of a Directed Graph","author":"Tarjan R. E.","year":"1972","unstructured":"Tarjan , R. E. , Enumeration of the Elementary Circuits of a Directed Graph . 1972 , Cornell University . Tarjan, R. E., Enumeration of the Elementary Circuits of a Directed Graph. 1972, Cornell University."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1116162.1116223"},{"key":"e_1_3_2_1_9_1","series-title":"SIAM Journal on Computing","volume-title":"Finding All the Elementary Circuits of a Directed Graph","author":"Johnson D.","year":"1975","unstructured":"Johnson , D. , Finding All the Elementary Circuits of a Directed Graph . SIAM Journal on Computing , 1975 . 4(1): p. 77--84. Johnson, D., Finding All the Elementary Circuits of a Directed Graph. SIAM Journal on Computing, 1975. 4(1): p. 77--84."},{"key":"e_1_3_2_1_10_1","unstructured":"Costa L. d. F. et al. Characterization of Complex Networks: A Survey of measurements in Instituto de F\u00edsica de S\u00e3o Carlos. 2006: Universidade de S\u00e3o Paulo Brazil.  Costa L. d. F. et al. Characterization of Complex Networks: A Survey of measurements in Instituto de F\u00edsica de S\u00e3o Carlos . 2006: Universidade de S\u00e3o Paulo Brazil."},{"key":"e_1_3_2_1_11_1","first-page":"17","volume":"196","author":"Erd\u0151s P.","unstructured":"Erd\u0151s , P. and A. R\u00e9nyi , On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci , 196 0. 5: p. 17 -- 61 . Erd\u0151s, P. and A. R\u00e9nyi, On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci, 1960. 5: p. 17--61.","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci"},{"key":"e_1_3_2_1_12_1","first-page":"261","volume":"196","author":"Erd\u0151s P.","unstructured":"Erd\u0151s , P. and A. R\u00e9nyi , On the strenght of connectedness of a random graph. Acta Mathematica Scientia Hungary , 196 1. 12: p. 261 -- 267 . Erd\u0151s, P. and A. R\u00e9nyi, On the strenght of connectedness of a random graph. Acta Mathematica Scientia Hungary, 1961. 12: p. 261--267.","journal-title":"Acta Mathematica Scientia Hungary"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2006\/06\/P06019"},{"key":"e_1_3_2_1_14_1","volume-title":"Exploring artificial intelligence in the new millennium.","author":"Yedidia J. S.","year":"2003","unstructured":"Yedidia , J. S. , W. T. Freeman , and Y. Weiss , Understanding belief propagation and its generalizations , in Exploring artificial intelligence in the new millennium. 2003 , Morgan Kaufmann Publishers Inc . p. 239--269. Yedidia, J. S., W. T. Freeman, and Y. Weiss, Understanding belief propagation and its generalizations, in Exploring artificial intelligence in the new millennium. 2003, Morgan Kaufmann Publishers Inc. p. 239--269."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1209\/epl\/i2001-00133-6"}],"event":{"name":"iiWAS '10: 12th International Conference on Information Integration and Web-based Applications & Services","sponsor":["IIWAS International Organization for Information Integration","Web-b Web-b","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Paris France","acronym":"iiWAS '10"},"container-title":["Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1967486.1967578","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1967486.1967578","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:22Z","timestamp":1750243942000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1967486.1967578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,8]]},"references-count":15,"alternative-id":["10.1145\/1967486.1967578","10.1145\/1967486"],"URL":"https:\/\/doi.org\/10.1145\/1967486.1967578","relation":{},"subject":[],"published":{"date-parts":[[2010,11,8]]},"assertion":[{"value":"2010-11-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}