{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:40:00Z","timestamp":1747179600940,"version":"3.40.5"},"reference-count":35,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"published-print":{"date-parts":[[2023,5,4]]},"DOI":"10.1080\/17445760.2023.2174540","type":"journal-article","created":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T17:15:10Z","timestamp":1676308510000},"page":"181-197","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["VSCT algorithm for graph partitioning based on volume, size, cuts and time"],"prefix":"10.1080","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6223-7941","authenticated-orcid":false,"given":"Chayma","family":"Sakouhi","sequence":"first","affiliation":[{"name":"RIADI Laboratory, National School of Computer Sciences, University of Manouba, Manouba, Tunisia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4529-7226","authenticated-orcid":false,"given":"Abir","family":"Khaldi","sequence":"additional","affiliation":[{"name":"RIADI Laboratory, National School of Computer Sciences, University of Manouba, Manouba, Tunisia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6874-1388","authenticated-orcid":false,"given":"Henda","family":"Ben Ghezala","sequence":"additional","affiliation":[{"name":"RIADI Laboratory, National School of Computer Sciences, University of Manouba, Manouba, Tunisia"}]}],"member":"301","published-online":{"date-parts":[[2023,2,13]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2018.00033"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078606"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1145\/3290688.3290711"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2013.13"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43352-2_15"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972924.2"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.08.005"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48096-0_27"},{"key":"CIT0011","unstructured":"Nicoara D, Kamali S, Daudjee K, et al. Hermes: dynamic partitioning for distributed social network graph databases. EDBT, Belgium; 2015. p. 25\u201336."},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2018.00072"},{"key":"CIT0013","unstructured":"Sakouhi C, Khaldi A, Ghezala HB. Volume: novel metric for graph partitioning. Proceedings of the International Conference on Information and Knowledge Engineering (IKE); The Steering Committee of The World Congress in Computer Science, Las Vegas, Nevada, USA; 2018. p. 174\u2013180."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2021.07.008"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00165-0"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598334138"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1155\/2000\/19436"},{"key":"CIT0020","unstructured":"Karypis G, Schloegel K, Kumar V. Parmetis: parallel graph partitioning and sparse matrix ordering library. 1997."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.2172\/10106339"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.4203\/csets.17.2"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74466-5_22"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_40"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_16"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2671868"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3001645"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.17"},{"key":"CIT0029","unstructured":"Bader DA, Meyerhenke H, Sanders P, et\u00a0al. Graph partitioning and graph clustering. Proceedings of the 10th Dimacs Implementation Challenge Workshop, Vol. 588; 2012 Feb 13\u201314. Atlanta (GA): Georgia Institute of Technology; 2013. p. 69."},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOGO.0000042115.44455.f3"},{"key":"CIT0031","unstructured":"Guerrieri A, Montresor A. Distributed edge partitioning for graph processing. preprint arXiv:14036270. 2014."},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1145\/2938503.2938506"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1145\/3466685"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00031"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2955494"}],"container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/17445760.2023.2174540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T13:35:09Z","timestamp":1681997709000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/17445760.2023.2174540"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,13]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5,4]]}},"alternative-id":["10.1080\/17445760.2023.2174540"],"URL":"https:\/\/doi.org\/10.1080\/17445760.2023.2174540","relation":{},"ISSN":["1744-5760","1744-5779"],"issn-type":[{"type":"print","value":"1744-5760"},{"type":"electronic","value":"1744-5779"}],"subject":[],"published":{"date-parts":[[2023,2,13]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-08-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-01-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}