{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:07:50Z","timestamp":1743113270587,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030054106"},{"type":"electronic","value":"9783030054113"}],"license":[{"start":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T00:00:00Z","timestamp":1543708800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05411-3_53","type":"book-chapter","created":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T15:37:22Z","timestamp":1543678642000},"page":"663-679","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Mathematical Analysis of a Network\u2019s Asymptotic Behaviour Based on Its Strongly Connected Components"],"prefix":"10.1007","author":[{"given":"Jan","family":"Treur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,2]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10703-006-4341-z","volume":"28","author":"R Bloem","year":"2006","unstructured":"Bloem, R., Gabow, H.N., Somenzi, F.: An algorithm for strongly connected component analysis in n log n symbolic steps. Form. Meth. Syst. Des. 28, 37\u201356 (2006)","journal-title":"Form. Meth. Syst. Des."},{"issue":"1","key":"53_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s12559-014-9277-9","volume":"7","author":"T Bosse","year":"2015","unstructured":"Bosse, T., Duell, R., Memon, Z.A., Treur, J., van der Wal, C.N.: Agent-based modelling of emotion contagion in groups. Cogn. Comput. 7(1), 111\u2013136 (2015)","journal-title":"Cogn. Comput."},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Chen, Y.: General spanning trees and reachability query evaluation. In: Desai, B.C. (ed.) Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering, C3S2E\u201909, pp. 243\u2013252. ACM Press (2009)","DOI":"10.1145\/1557626.1557665"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Fleischer, L.K., Hendrickson, B., P\u0131nar, A.: On identifying strongly connected components in parallel. In: Rolim J. (ed) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol. 1800, pp. 505\u2013511. Springer (2000)","DOI":"10.1007\/3-540-45591-4_68"},{"key":"53_CR5","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proceedings of the SODA\u201903, pp. 573\u2013582 (2003)"},{"key":"53_CR6","volume-title":"Structural models: an introduction to the theory of directed graphs","author":"F Harary","year":"1965","unstructured":"Harary, F., Norman, R.Z., Cartwright, D.: Structural models: an introduction to the theory of directed graphs. Wiley, New York (1965)"},{"key":"53_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0019-9958(70)90105-1","volume":"16","author":"W Kuich","year":"1970","unstructured":"Kuich, W.: On the entropy of context-free languages. Inf. Control 16, 173\u2013200 (1970)","journal-title":"Inf. Control"},{"issue":"1","key":"53_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.sysarc.2013.10.014","volume":"60","author":"G Li","year":"2014","unstructured":"Li, G., Zhu, Z., Cong, Z., Yang, F.: Efficient decomposition of strongly connected components on GPUs. J. Syst. Architect. 60(1), 1\u201310 (2014)","journal-title":"J. Syst. Architect."},{"issue":"2","key":"53_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"53_CR10","doi-asserted-by":"crossref","unstructured":"Treur, J.: Network-Oriented Modeling: Addressing the Complexity of Cognitive, Affective and Social Interactions. Springer Publishers (2016)","DOI":"10.1007\/978-3-319-45213-5"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Treur, J.: The Ins and Outs of Network-Oriented Modeling: from Biological Networks and Mental Networks to Social Networks and Beyond. Paper for Keynote Lecture at ICCCI\u201918. Springer Publishers (2018)","DOI":"10.1007\/978-3-662-58611-2_2"},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"Treur, J.: Relating emerging network behaviour to network structure. In: Proceedings of the 7th International Conference on Complex Networks and their Applications, ComplexNetworks\u201918. Studies in Computational Intelligence, Springer (2018)","DOI":"10.1007\/978-3-030-05411-3_50"},{"key":"53_CR13","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/s10703-016-0246-7","volume":"48","author":"A Wijs","year":"2016","unstructured":"Wijs, A., Katoen, J.P., Bo\u0161nacki, D.: Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components. Form. Methods Syst. Des. 48, 274\u2013300 (2016)","journal-title":"Form. Methods Syst. Des."}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05411-3_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T08:28:02Z","timestamp":1573028882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05411-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,2]]},"ISBN":["9783030054106","9783030054113"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05411-3_53","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2018,12,2]]},"assertion":[{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}