{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T14:10:12Z","timestamp":1687615812253},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T00:00:00Z","timestamp":1342569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Inf Syst Front"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10796-012-9366-9","type":"journal-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T00:32:21Z","timestamp":1342657941000},"page":"193-202","source":"Crossref","is-referenced-by-count":3,"title":["Estimation algorithm for counting periodic orbits in complex social networks"],"prefix":"10.1007","volume":"15","author":[{"given":"Ibrahim","family":"Sorkhoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled A.","family":"Mahdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maytham","family":"Safar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,18]]},"reference":[{"issue":"1","key":"9366_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/jdwm.2010090801","volume":"6","author":"R Angelova","year":"2010","unstructured":"Angelova, R., Lipczak, M., & Milios, E., Pralat,\u00a0P. (2010). Investigating the properties of a social bookmarking and tagging network. International Journal of Data Warehousing and Mining, 6(1), 1\u201319.","journal-title":"International Journal of Data Warehousing and Mining"},{"key":"9366_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1997","unstructured":"Barab\u00e1si, A.\u00a0L., & Albert, R. (1997). Emergence of scaling in random networks. Science, 286, 509\u2013512.","journal-title":"Science"},{"issue":"1","key":"9366_CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"LdF Costa","year":"2007","unstructured":"Costa, L. d. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007). Characterization of complex networks: a survey of measurements. Advances in Physics, 56(1), 167\u2013242..","journal-title":"Advances in Physics"},{"key":"9366_CR4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., & R\u00e9nyi, A. (1959). On random graphs. Publicationes Mathematicae, 6, 290\u2013297.","journal-title":"Publicationes Mathematicae"},{"key":"9366_CR5","first-page":"17","volume":"5","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., & R\u00e9nyi, A. (1960). On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 5, 17\u201361.","journal-title":"Publication of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"9366_CR6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","volume":"12","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P., & R\u00e9nyi, A. (1961). On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary, 12, 261\u2013267.","journal-title":"Acta Mathematica Scientia Hungary"},{"issue":"1","key":"9366_CR7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"D Johnson","year":"1975","unstructured":"Johnson, D. (1975). Finding all the elementary circuits of a directed graph. SIAM Journal on Computing, 4(1), 77\u201384.","journal-title":"SIAM Journal on Computing"},{"key":"9366_CR8","unstructured":"Liu, H., & Wang, J. (2006). A new way to enumerate cycles in graph. In Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (pp. 57)."},{"issue":"4","key":"9366_CR9","first-page":"333","volume":"5","author":"K Mahdi","year":"2009","unstructured":"Mahdi, K., Safar, M., & Farahat, H. (2009a). Analysis of temporal evolution of social networks. Journal of Mobile Multimedia, 5(4), 333\u2013350.","journal-title":"Journal of Mobile Multimedia"},{"key":"9366_CR10","volume-title":"IADIS international conference e-society","author":"K Mahdi","year":"2008","unstructured":"Mahdi, K., Safar, M., & Sorkhoh, I. (2008). Entropy of robust social networks. In IADIS international conference e-society, Algarve, Portugal."},{"key":"9366_CR11","unstructured":"Mahdi, K., Safar, M., & Torabi, S. (2009b). A model of diffusion parameter characterizing social networks. In IADIS international conference e-society."},{"issue":"6","key":"9366_CR12","first-page":"383","volume":"7","author":"KA Mahdi","year":"2009c","unstructured":"Mahdi, K. A., Safar, M., Sorkhoh, I., & Kassem, A. (2009c). Cycle-based versus degree-based classification of social networks. Journal of Digital Information Management, 7(6), 383\u2013389.","journal-title":"Journal of Digital Information Management"},{"key":"9366_CR13","unstructured":"Marinari, E., & Semerjian, G. (2006). On the number of circuits in random graphs. Journal of Statistical Mechanics: Theory and Experiment, 2006, P06019."},{"issue":"1","key":"9366_CR14","first-page":"60","volume":"1","author":"S Milgram","year":"1967","unstructured":"Milgram, S. (1967). The small world problem. Psychology Today, 1(1), 60\u201367.","journal-title":"Psychology Today"},{"issue":"1","key":"9366_CR15","doi-asserted-by":"crossref","first-page":"20","DOI":"10.4018\/jdwm.2010090802","volume":"6","author":"S Papadopoulos","year":"2010","unstructured":"Papadopoulos, S., Vakali, A., & Kompatsiaris, I. (2010). The dynamics of content popularity in social media. International Journal of Data Warehousing and Mining, 6(1), 20\u201337.","journal-title":"International Journal of Data Warehousing and Mining"},{"issue":"2","key":"9366_CR16","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1209\/epl\/i2001-00133-6","volume":"53","author":"PDL Rios","year":"2001","unstructured":"Rios, P.\u00a0D.\u00a0L, Lise, S., & Pelizzola, A. (2001). Bethe approximation for self-interacting lattice trees. EPL (Europhysics Letters), 53(2), 176\u2013182.","journal-title":"EPL (Europhysics Letters)"},{"key":"9366_CR17","unstructured":"Safar, M., & Ghaith, H.\u00a0B. (2006). Friends network. In IADIS international conference WWW\/Internet, Murcia, Spain."},{"key":"9366_CR18","unstructured":"Safar, M., Mahdi, K., & Sorkhoh, I. (2008). Maximum entropy of fully connected social network. In IADIS international conference web based communities, Amsterdam, Holland."},{"issue":"6","key":"9366_CR19","first-page":"983","volume":"16","author":"M Safar","year":"2010","unstructured":"Safar, M., El-Sayed, N., Mahdi, K., & Taniar, D. (2010). Entropy optimization of social networks using evolutionary algorithm. Journal of Universal Computer Science, 16(6), 983\u20131003.","journal-title":"Journal of Universal Computer Science"},{"key":"9366_CR20","unstructured":"Tarjan, R.\u00a0E. (1972). Enumeration of the elementary circuits of a directed graph. Tech. rep., Cornell University."},{"issue":"2","key":"9366_CR21","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.physa.2005.08.025","volume":"363","author":"B Wang","year":"2005","unstructured":"Wang, B., Tang, H., Guo, C., & Xiu, Z. (2005). Entropy optimization of scale-free networks\u2019 robustness to random failures. Physica A, 363(2), 591\u2013596.","journal-title":"Physica A"},{"key":"9366_CR22","unstructured":"Watts, D.\u00a0J. (2003a). Small worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press."},{"key":"9366_CR23","unstructured":"Watts, D.\u00a0J. (2003b). Six degrees. The Science of a Connected Age. W. W. Norton & Company."},{"issue":"6684","key":"9366_CR24","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.\u00a0J., & Strogatz, S.\u00a0H. (1998). Collective dynamics of small-world networks. Nature, 393(6684), 440\u2013442.","journal-title":"Nature"},{"issue":"1","key":"9366_CR25","doi-asserted-by":"crossref","first-page":"38","DOI":"10.4018\/jdwm.2010090803","volume":"6","author":"R Wetzker","year":"2010","unstructured":"Wetzker, R., Zimmermann, C., & Bauckage, C. (2010). Detecting trends in social bookmarking systems: A de.icio.us endeavor. International Journal of Data Warehousing and Mining, 6(1), 38\u201357.","journal-title":"International Journal of Data Warehousing and Mining"},{"key":"9366_CR26","unstructured":"Yedidia, J.\u00a0S., Freeman, W.\u00a0T., & Weiss, Y. (2003). Understanding belief propagation and its generalizations. In Exploring artificial intelligence in the new millennium (pp.\u00a0239\u2013269). Morgan Kaufmann Publishers Inc."}],"container-title":["Information Systems Frontiers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-012-9366-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10796-012-9366-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-012-9366-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T13:35:31Z","timestamp":1687613731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10796-012-9366-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,18]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9366"],"URL":"https:\/\/doi.org\/10.1007\/s10796-012-9366-9","relation":{},"ISSN":["1387-3326","1572-9419"],"issn-type":[{"value":"1387-3326","type":"print"},{"value":"1572-9419","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,18]]}}}