{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:39:40Z","timestamp":1743125980335,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030600280"},{"type":"electronic","value":"9783030600297"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-60029-7_40","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T23:07:40Z","timestamp":1600729660000},"page":"441-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Partition of Large Graphs Combining Local Nodes Exchange with Directed Dynamic Maintenance"],"prefix":"10.1007","author":[{"given":"Xiaohuan","family":"Shan","sequence":"first","affiliation":[]},{"given":"Xiyi","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Yulong","family":"Song","sequence":"additional","affiliation":[]},{"given":"Menglin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Baoyan","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.eswa.2017.05.066","volume":"86","author":"J Calle","year":"2017","unstructured":"Calle, J., Rivero, J., Cuadra, J., et al.: Extending ACO for fast path search in huge graphs and social networks. Expert Syst. Appl. 86, 292\u2013306 (2017). https:\/\/doi.org\/10.1016\/j.eswa.2017.05.066","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"40_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/s12859-017-1525-z","volume":"18","author":"AB Sonmez","year":"2017","unstructured":"Sonmez, A.B., Can, C.: Comparison of tissue\/disease specific integrated networks using directed graphlet signatures. BMC Bioinform. 18(4), 41\u201350 (2017). https:\/\/doi.org\/10.1186\/s12859-017-1525-z","journal-title":"BMC Bioinform."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Aydin, B., Henning, M., Llya, S, et al.: Recent advances in graph partitioning. Algorithm Eng. 56, 117\u2013158 (2016). http:\/\/doi.org\/10.1007\/978-3-319-49487-6_4","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Mazaheri Soudani, N., Fatemi, A., Nematbakhsh, M.: An investigation of big graph partitioning methods for distribution of graphs in vertex-centric systems. Distrib. Parallel Databases, 1\u201329 (2019). http:\/\/doi.org\/10.1007\/s10619-019-07256-z","DOI":"10.1007\/s10619-019-07256-z"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.future.2017.01.014","volume":"71","author":"Z Shi","year":"2017","unstructured":"Shi, Z., Li, J.H., Guo, P.F., et al.: Partitioning dynamic graph asynchronously with distributed FENNEL. Fut. Generat. Comput. Syst. 71, 32\u201342 (2017). https:\/\/doi.org\/10.1016\/j.future.2017.01.014","journal-title":"Fut. Generat. Comput. Syst."},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-030-30952-7_24","volume-title":"Web Information Systems and Applications","author":"X Shan","year":"2019","unstructured":"Shan, X., Ma, J., Gao, J., Xu, Z., Song, B.: A subgraph query method based on adjacent node features on large-scale label graphs. In: Ni, W., Wang, X., Song, W., Li, Y. (eds.) WISA 2019. LNCS, vol. 11817, pp. 226\u2013238. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30952-7_24"},{"key":"40_CR7","doi-asserted-by":"publisher","unstructured":"Fiduccia, C.M., Matteyses, R.A.: Linear-time heuristic for improving network partitions. In: Proceedings of the 19th Design Automation Conference. Institute of Electrical and Electronics Engineers, pp. 175\u2013181 (1988). https:\/\/doi.org\/10.1145\/62882.62910","DOI":"10.1145\/62882.62910"},{"issue":"3","key":"40_CR8","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430\u2013452 (1990). https:\/\/doi.org\/10.1137\/0611030","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"40_CR9","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/TC.1987.1676942","volume":"100","author":"MJ Berger","year":"2006","unstructured":"Berger, M.J., Bokhari, S.H.: A partitioning strategy for nonuniform problems on multiprocessors. IEEE Trans. Comput. 100(5), 570\u2013580 (2006). https:\/\/doi.org\/10.1109\/TC.1987.1676942","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"40_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A Lisser","year":"2003","unstructured":"Lisser, A., Rendl, F.: Graph partitioning using linear and semidefinite programming. Math. Program. 95(1), 91\u2013101 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0342-x","journal-title":"Math. Program."},{"key":"40_CR11","doi-asserted-by":"publisher","unstructured":"Filippidou, I., Kotid, Y.: Online partitioning of multi-labeled graphs. In: Proceedings of the GRADES 2015, ACM, 1\u20136 (2015). https:\/\/doi.org\/10.1145\/2764947.2764950","DOI":"10.1145\/2764947.2764950"},{"issue":"6","key":"40_CR12","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/TEVC.2019.2896951","volume":"23","author":"RJ Preen","year":"2019","unstructured":"Preen, R.J., Smith, J.: Evolutionary n-level hypergraph partitioning with adaptive coarsening. IEEE Trans. Evol. Comput. 23(6), 962\u2013971 (2019). https:\/\/doi.org\/10.1109\/TEVC.2019.2896951","journal-title":"IEEE Trans. Evol. Comput."},{"key":"40_CR13","doi-asserted-by":"publisher","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., et al.: JA-BE-JA: a distributed algorithm for balanced graph partitioning. In: IEEE International Conference on Self-adaptive & Self-organizing Systems. IEEE, pp. 51\u201360 (2013). https:\/\/doi.org\/10.1109\/saso.2013.13","DOI":"10.1109\/saso.2013.13"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Chen, T., Li, B.: A distributed graph partitioning algorithm for processing large graphs. In: IEEE Symposium on Service-oriented System Engineering. IEEE, 53\u201359(2016). http:\/\/doi.org\/10.1109\/SOSE.2016.48","DOI":"10.1109\/SOSE.2016.48"},{"key":"40_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-030-22744-9_29","volume-title":"Computational Science \u2013 ICCS 2019","author":"E Osaba","year":"2019","unstructured":"Osaba, E., et al.: Dynamic partitioning of evolving graph streams using nature-inspired heuristics. In: Rodrigues, J.M.F., et al. (eds.) ICCS 2019. LNCS, vol. 11538, pp. 367\u2013380. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22744-9_29"},{"key":"40_CR16","doi-asserted-by":"publisher","unstructured":"Chayma, S., Sabeur, A., Alessio, G., et al.: DynamicDFEP: a distributed edge partitioning approach for large dynamic graphs. In: Proceedings of the 20th International Database Engineering & Applications Symposium, pp. 142\u2013147. ACM (2016). https:\/\/doi.org\/10.1145\/2938503.2938506","DOI":"10.1145\/2938503.2938506"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-662-48096-0_27","volume-title":"Euro-Par 2015: Parallel Processing","author":"A Guerrieri","year":"2015","unstructured":"Guerrieri, A., Montresor, A.: DFEP: distributed funding-based edge partitioning. In: Tr\u00e4ff, J.L., Hunold, S., Versaci, F. (eds.) Euro-Par 2015. LNCS, vol. 9233, pp. 346\u2013358. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48096-0_27"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60029-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:44:33Z","timestamp":1709811873000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60029-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030600280","9783030600297"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60029-7_40","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":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"23 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wisa.pmease.cn\/wisa2020\/index.html","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":"CCF Consys","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"165","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":"42","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":"16","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":"25% - 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":"3.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":"7.2","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)"}}]}}