{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:38:26Z","timestamp":1725878306832},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_9","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T06:17:39Z","timestamp":1484029059000},"page":"103-115","source":"Crossref","is-referenced-by-count":2,"title":["Distributed Network Generation Based on Preferential Attachment in ABS"],"prefix":"10.1007","author":[{"given":"Keyvan","family":"Azadbakht","sequence":"first","affiliation":[]},{"given":"Nikolaos","family":"Bezirgiannis","sequence":"additional","affiliation":[]},{"given":"Frank S.","family":"de Boer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"9_CR1","first-page":"49","volume":"4","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the central limit theorem for samples from a finite population. Publ. Math. Inst. Hungar. Acad. Sci 4, 49\u201361 (1959)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci"},{"issue":"6684","key":"9_CR2","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"5439","key":"9_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"2","key":"9_CR4","first-page":"176","volume":"7","author":"R Tonelli","year":"2010","unstructured":"Tonelli, R., Concas, G., Locci, M.: Three efficient algorithms for implementing the preferential attachment mechanism in Yule-Simon stochastic process. WSEAS Trans. Inf. Sci. Appl. 7(2), 176\u2013185 (2010)","journal-title":"WSEAS Trans. Inf. Sci. Appl."},{"key":"9_CR5","volume-title":"Dynamics of Large Networks","author":"J Leskovec","year":"2008","unstructured":"Leskovec, J.: Dynamics of Large Networks. ProQuest, Ann Arbor (2008)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bader, D., Madduri, K., et al.: Parallel algorithms for evaluating centrality indices in real-world networks. In: International Conference on Parallel Processing, ICPP 2006, pp. 539\u2013550. IEEE (2006)","DOI":"10.1109\/ICPP.2006.57"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-25271-6_8","volume-title":"Formal Methods for Components and Objects","author":"EB Johnsen","year":"2011","unstructured":"Johnsen, E.B., H\u00e4hnle, R., Sch\u00e4fer, J., Schlatte, R., Steffen, M.: ABS: a core language for abstract behavioral specification. In: Aichernig, B.K., Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2010. LNCS, vol. 6957, pp. 142\u2013164. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25271-6_8"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-319-21401-6_35","volume-title":"Automated Deduction - CADE-25","author":"CC Din","year":"2015","unstructured":"Din, C.C., Bubel, R., H\u00e4hnle, R.: KeY-ABS: a deductive verification tool for the concurrent modelling language ABS. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS, vol. 9195, pp. 517\u2013526. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-21401-6_35"},{"issue":"3","key":"9_CR9","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1002\/stvr.1569","volume":"25","author":"E Albert","year":"2015","unstructured":"Albert, E., Arenas, P., Correas, J., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G., Rom\u00e1n-D\u00edez, G.: Object-sensitive cost analysis for concurrent objects. Softw. Test. Verification Reliab. 25(3), 218\u2013271 (2015)","journal-title":"Softw. Test. Verification Reliab."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Epstein, J., Black, A.P., Peyton-Jones, S.: Towards haskell in the cloud. In: ACM SIGPLAN Notices, vol. 46, pp. 118\u2013129. ACM (2011)","DOI":"10.1145\/2034675.2034690"},{"issue":"1","key":"9_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40649-015-0012-9","volume":"2","author":"J Atwood","year":"2015","unstructured":"Atwood, J., Ribeiro, B., Towsley, D.: Efficient network generation under general preferential attachment. Comput. Soc. Netw. 2(1), 1 (2015)","journal-title":"Comput. Soc. Netw."},{"issue":"3","key":"9_CR12","doi-asserted-by":"crossref","first-page":"036113","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V Batagelj","year":"2005","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E 71(3), 036113 (2005)","journal-title":"Phys. Rev. E"},{"key":"9_CR13","unstructured":"Yoo, A., Henderson, K.: Parallel generation of massive scale-free graphs. arXiv preprint arXiv:1003.3684 (2010)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Lo, Y.C., Li, C.T., Lin, S.D.: Parallelizing preferential attachment models for generating large-scale social networks that cannot fit into memory. In: Privacy, Security, Risk and Trust (PASSAT), 2012 International Conference on and 2012 International Confernece on Social Computing (SocialCom), pp. 229\u2013238. IEEE (2012)","DOI":"10.1109\/SocialCom-PASSAT.2012.28"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Alam, M., Khan, M., Marathe, M.V.: Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model. In: Proceedings of SC13: International Conference for High Performance Computing, Networking, Storage and Analysis, p. 91. ACM (2013)","DOI":"10.1145\/2503210.2503291"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"\u015eerb\u0103nescu, V., Azadbakht, K., de Boer, F.: A java-based distributed approach for generating large-scale social network graphs. In: Pop, F., Ko\u0142lodziej, J., Di Martino, B. (eds.) Resource Management for Big Data Platforms, pp. 401\u2013417. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-44881-7_19"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-662-49192-8_35","volume-title":"SOFSEM 2016: Theory and Practice of Computer Science","author":"N Bezirgiannis","year":"2016","unstructured":"Bezirgiannis, N., Boer, F.: ABS: a high-level modeling language for cloud-aware programming. In: Freivalds, R.M., Engels, G., Catania, B. (eds.) SOFSEM 2016. LNCS, vol. 9587, pp. 433\u2013444. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49192-8_35"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-319-39519-7_13","volume-title":"Coordination Models and Languages","author":"L Henrio","year":"2016","unstructured":"Henrio, L., Rochas, J.: From modelling to systematic deployment of distributed active objects. In: Lluch Lafuente, A., Proen\u00e7a, J. (eds.) COORDINATION 2016. LNCS, vol. 9686, pp. 208\u2013226. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-39519-7_13"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Azadbakht, K., de Boer, F.S., Serbanescu, V.: Multi-threaded actors. arXiv preprint arXiv:1608.03322 (2016)","DOI":"10.4204\/EPTCS.223.4"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Azadbakht, K., Bezirgiannis, N., de Boer, F.S., Aliakbary, S.: A high-level and scalable approach for generating scale-free graphs using active objects. In: Proceedings of the 31st Annual ACM Symposium on Applied Computing, pp. 1244\u20131250. ACM (2016)","DOI":"10.1145\/2851613.2851722"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: 2000 Proceedings of 41st Annual Symposium on Foundations of Computer Science, pp. 57\u201365. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892065"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T10:02:59Z","timestamp":1568714579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}