{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:45:29Z","timestamp":1742946329365,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031592041"},{"type":"electronic","value":"9783031592058"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-59205-8_10","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T15:01:38Z","timestamp":1714316498000},"page":"146-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Graph Clustering for\u00a0Distributed Computing Environments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9525-3497","authenticated-orcid":false,"given":"Przemys\u0142aw","family":"Szufel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"10_CR1","unstructured":"Aref, S., Chheda, H., Mostajabdaveh, M.: The Bayan algorithm: Detecting communities in networks through exact and approximate optimization of modularity. arXiv preprint arXiv:2209.04562 (2022)"},{"key":"10_CR2","unstructured":"Bezanson, J., Karpinski, S., Shah, V.B., Edelman, A.: Julia: A fast dynamic language for technical computing. arXiv preprint arXiv:1209.5145 (2012)"},{"issue":"10","key":"10_CR3","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"10_CR5","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2021), https:\/\/www.gurobi.com"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1017\/nws.2020.45","volume":"9","author":"B Kami\u0144ski","year":"2021","unstructured":"Kami\u0144ski, B., Pra\u0142at, P., Th\u00e9berge, F.: Artificial benchmark for community detection (ABCD)-fast random graph model with community structure. Netw. Sci. 9(2), 153\u2013178 (2021)","journal-title":"Netw. Sci."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2023.09.023","volume":"314","author":"M Nowak","year":"2024","unstructured":"Nowak, M., Szufel, P.: Technician routing and scheduling for the sharing economy. Eur. J. Oper. Res. 314(1), 15\u201331 (2024)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0165-9","volume":"4","author":"G Rossetti","year":"2019","unstructured":"Rossetti, G., Milli, L., Cazabet, R.: CDLIB: a python library to extract, compare and evaluate communities from complex networks. Appl. Netw. Sci. 4(1), 1\u201326 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0165-9","journal-title":"Appl. Netw. Sci."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Safra, S., Schwartz, O.: On the complexity of approximating tsp with neighborhoods and related problems. Comput. Complexity 14, 281\u2013307 (2006)","DOI":"10.1007\/s00037-005-0200-3"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.cor.2018.01.012","volume":"106","author":"K Sato","year":"2019","unstructured":"Sato, K., Izunaga, Y.: An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs. Comput. Oper. Res. 106, 236\u2013245 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag, V.A., Waltman, L., Van Eck, N.J.: From Louvain to Leiden: guaranteeing well-connected communities. Sci. Rep. 9(1), 5233 (2019)","journal-title":"Sci. Rep."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Wang, D., Joshi, G., Wornell, G.: Efficient task replication for fast response times in parallel computation. In: The 2014 ACM International Conference on Measurement and Modeling of Computer Systems, pp. 599\u2013600 (2014)","DOI":"10.1145\/2591971.2592042"}],"container-title":["Lecture Notes in Computer Science","Modelling and Mining Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-59205-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T16:03:18Z","timestamp":1715356998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59205-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031592041","9783031592058"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59205-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.torontomu.ca\/waw2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}