{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:56:00Z","timestamp":1743054960991,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030590024"},{"type":"electronic","value":"9783030590031"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59003-1_2","type":"book-chapter","created":{"date-parts":[[2020,9,13]],"date-time":"2020-09-13T14:02:26Z","timestamp":1600005746000},"page":"23-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Graph Partitioning Algorithm for Edge or Vertex Balance"],"prefix":"10.1007","author":[{"given":"Adnan El","family":"Moussawi","sequence":"first","affiliation":[]},{"given":"Nac\u00e9ra Bennacer","family":"Seghouani","sequence":"additional","affiliation":[]},{"given":"Francesca","family":"Bugiotti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,14]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge discovery and data mining, p. 44. ACM Press (2006)","DOI":"10.1145\/1150402.1150412"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bader, D., Meyerhenke, H., Wagner, D.: Graph Partitioning and Graph Clustering, Contemporary Mathematics, vol. 588 (2013)","DOI":"10.1090\/conm\/588"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-49487-6_4","volume-title":"Algorithm Engineering","author":"A Bulu\u00e7","year":"2016","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 117\u2013158. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49487-6_4"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chakraborty, T., Dalmia, A., Mukherjee, A., Ganguly, N.: Metrics for community analysis: a survey 50(4), 1\u201337 (2016)","DOI":"10.1145\/3091106"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Chevalier, C., Pellegrini, F.: PT-Scotch: a tool for efficient parallel graph ordering. Technical report, pp. 6-8 (2008)","DOI":"10.1016\/j.parco.2007.12.001"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Das, H., Kumar, S.: A parallel TSP-based algorithm for balanced graph partitioning. In: 2017 46th International Conference on Parallel Processing (ICPP), pp. 563\u2013570. IEEE (2017)","DOI":"10.1109\/ICPP.2017.65"},{"key":"2_CR7","unstructured":"Giraph, A.: Giraph : Large-scale graph processing in Hadoop (2012)"},{"key":"2_CR8","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: PowerGraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, pp. 17\u201330 (2012)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Gregory, S.: Finding overlapping communities in networks by label propagation 12(10), 103018 (2010)","DOI":"10.1088\/1367-2630\/12\/10\/103018"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Heidari, S., Simmhan, Y., Calheiros, N., Buyya, R.: Scalable graph processing frameworks: a taxonomy and open challenges 51, 1\u201353 (2018)","DOI":"10.1145\/3199523"},{"key":"2_CR11","unstructured":"Henzinger, A., Noe, A., Schulz, C.: ILP-based local search for graph partitioning (2018)"},{"key":"2_CR12","unstructured":"Karypis, G., Kumar, V.: Multilevel graph partitioning schemes. In: Proceedings of the 24th International Conference on Parallel Processing (ICPP) 1955, vol. 3, pp. 113\u2013122 (1995)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering, 48(1), 71\u201395 (1998)","DOI":"10.1006\/jpdc.1997.1403"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the 28th International Conference on Human factors in computing systems, p. 1361 (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"2_CR15","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection (2014). https:\/\/snap.stanford.edu\/data\/index.html"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters 6(1), 29\u2013123 (2009)","DOI":"10.1080\/15427951.2009.10129177"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-48743-4_22","volume-title":"Web Information Systems Engineering \u2013 WISE 2016","author":"Y Li","year":"2016","unstructured":"Li, Y., Constantin, C., du Mouza, C.: A block-based edge partitioning for random walks algorithms over large social graphs. In: Cellary, W., Mokbel, M.F., Wang, J., Wang, H., Zhou, R., Zhang, Y. (eds.) WISE 2016. LNCS, vol. 10042, pp. 275\u2013289. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48743-4_22"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/18.61115","volume":"37","author":"J Lin","year":"1991","unstructured":"Lin, J.: Divergence measures based on the shannon entropy. IEEE Trans. Inf. Theory 37(1), 145\u2013151 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Martella, C., Logothetis, D., Loukas, A., Siganos, G.: Spinner: scalable graph partitioning in the cloud. In: Proceedings - International Conference Data Engineering (2017)","DOI":"10.1109\/ICDE.2017.153"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Meyerhenke, H., Sanders, P., Schulz, C.: Parallel graph partitioning for complex networks, 28, 2625\u20132638 (2017)","DOI":"10.1109\/TPDS.2017.2671868"},{"key":"2_CR22","unstructured":"Nguyen, D.: Graph Partitioning. ISTE (2011)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Pellegrini, F., Roman, J.: Scotch: a software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In: Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking, pp. 493\u2013498. HPCN Europe 1996 (1996)","DOI":"10.1007\/3-540-61142-8_588"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks, p. 036106 (2007)","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29 AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-38527-8_16","volume-title":"Experimental Algorithms","author":"P Sanders","year":"2013","unstructured":"Sanders, P., Schulz, C.: Think locally, act globally: highly balanced graph partitioning. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 164\u2013175. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_16"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Gkantsidis, C., Radunovic, B., Vojnovic, M.: FENNEL: streaming graph partitioning for massive scale graphs. In: Proceedings of the 7th ACM International Conference on Web search and data mining, pp. 333\u2013342 (2014)","DOI":"10.1145\/2556195.2556213"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Ugander, J., Backstrom, L.: Balanced label propagation for partitioning massive graphs. In: Proceedings of the 6th ACM International Conference on Web Search and Data Mining, pp. 507\u2013516. WSDM 2013, ACM (2013)","DOI":"10.1145\/2433396.2433461"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J., Stoica, I.: GraphX: a resilient distributed graph system on spark. In: First International Workshop on Graph Data Management Experiences and Systems, pp. 1\u20136. ACM Press (2013)","DOI":"10.1145\/2484425.2484427"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Zafarani, R., Liu, H.: Users joining multiple sites: distributions and patterns (2014)","DOI":"10.1609\/icwsm.v8i1.14564"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59003-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:17:34Z","timestamp":1710339454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59003-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590024","9783030590031"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59003-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"190","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online. DEXA Workshops volume: submissions sent - 15, full papers accepted - 6, short papers accepted - 4, reviewers per paper 3, papers per reviewer 1-2","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}