{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:36:32Z","timestamp":1769924192037,"version":"3.49.0"},"publisher-location":"New York, New York, USA","reference-count":13,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1145\/3368926.3369724","type":"proceedings-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T13:30:11Z","timestamp":1576848611000},"page":"419-424","source":"Crossref","is-referenced-by-count":1,"title":["A Genetic Algorithm for Large Graph Partitioning Problem"],"prefix":"10.1145","author":[{"given":"Xuan-Tung","family":"Nguyen","sequence":"first","affiliation":[{"name":"Software Engineering, Hanoi University of Science and Technology, Ha Noi, Vietnam"}]},{"given":"Phuong-Nam","family":"Cao","sequence":"additional","affiliation":[{"name":"Software Engineering, Hanoi University of Science and Technology, Ha Noi, Vietnam"}]},{"given":"Van-Quyet","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Information Technology, Hung Yen University Technology and Education, Hung Yen, Vietnam"}]},{"given":"Kyungbaek","family":"Kim","sequence":"additional","affiliation":[{"name":"Electronics and Computer Engineering, Chonnam National University, Gwangju, Korea"}]},{"given":"Quyet-Thang","family":"Huynh","sequence":"additional","affiliation":[{"name":"Software Engineering, Hanoi University of Science and Technology, Ha Noi, Vietnam"}]}],"member":"320","reference":[{"key":"key-10.1145\/3368926.3369724-1","doi-asserted-by":"crossref","unstructured":"Nguyen-Van, Q., Tung, L.D. and Hu, Z., 2013, December. Minimizing data transfers for regular reachability queries on distributed graphs. In Proceedings of the Fourth Symposium on Information and Communication Technology (pp. 325--334). ACM.","DOI":"10.1145\/2542050.2542092"},{"key":"key-10.1145\/3368926.3369724-2","doi-asserted-by":"crossref","unstructured":"Rahimian, Fatemeh, et al. \"Ja-be-ja: A distributed algorithm for balanced graph partitioning.\" 2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems. IEEE, 2013.","DOI":"10.1109\/SASO.2013.13"},{"key":"key-10.1145\/3368926.3369724-3","doi-asserted-by":"crossref","unstructured":"Garey, Michael R., David S. Johnson, and Larry Stockmeyer. \"Some simplified NP-complete problems.\" Proceedings of the sixth annual ACM symposium on Theory of computing. ACM, 1974","DOI":"10.1145\/800119.803884"},{"key":"key-10.1145\/3368926.3369724-4","doi-asserted-by":"crossref","unstructured":"Nguyen, V.Q. and Kim, K., 2017, December. Estimating the evaluation cost of regular path queries on large graphs. In Proceedings of the Eighth International Symposium on Information and Communication Technology (pp. 92--99). ACM.","DOI":"10.1145\/3155133.3155160"},{"key":"key-10.1145\/3368926.3369724-5","doi-asserted-by":"crossref","unstructured":"V.-Q. Nguyen, Q.-T. Huynh, and K. Kim, \"Estimating searching cost of regular path queries on large graphs by exploiting unit-subqueries,\" Journal of Heuristics, pp. 1--21, Nov 2018. [Online]. Available: https:\/\/doi.org\/10.1007\/s10732-018-9402-0","DOI":"10.1007\/s10732-018-9402-0"},{"key":"key-10.1145\/3368926.3369724-6","doi-asserted-by":"crossref","unstructured":"Charbel Farhat. A simple and efficient automatic FEM domain decomposer. Computers and Structures, 28(5):579--602, 1988","DOI":"10.1016\/0045-7949(88)90004-1"},{"key":"key-10.1145\/3368926.3369724-7","unstructured":"George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. to appear in SIAM Journal on Scientific Computing."},{"key":"key-10.1145\/3368926.3369724-8","doi-asserted-by":"crossref","unstructured":"Chen, Tefeng, and Bo Li. \"A distributed graph partitioning algorithm for processing large graphs.\" 2016 IEEE Symposium on Service-Oriented System Engineering (SOSE). IEEE, 2016.","DOI":"10.1109\/SOSE.2016.48"},{"key":"key-10.1145\/3368926.3369724-9","unstructured":"J. McAuley and J. Leskovec, 'Social circles: Facebook', NIPS 2012, [Online] Available: http:\/\/snap.stanford.edu\/data\/ego-Facebook.html"},{"key":"key-10.1145\/3368926.3369724-10","unstructured":"J. Leskovec, J. Kleinberg and C. Faloutsosm, 'General Relativity and Quantum Cosmology collaboration network', ACM TKDD 2007, [Online] Available: https:\/\/snap.stanford.edu\/data\/ca-GrQc.html"},{"key":"key-10.1145\/3368926.3369724-11","doi-asserted-by":"crossref","unstructured":"Sanders, Peter, and Christian Schulz. \"Engineering multilevel graph partitioning algorithms.\" European Symposium on Algorithms. Springer, Berlin, Heidelberg, 2011.","DOI":"10.1007\/978-3-642-23719-5_40"},{"key":"key-10.1145\/3368926.3369724-12","doi-asserted-by":"crossref","unstructured":"Walshaw, Chris. \"Multilevel refinement for combinatorial optimisation problems.\" Annals of Operations Research 131.1-4 (2004): 325--372.","DOI":"10.1023\/B:ANOR.0000039525.80601.15"},{"key":"key-10.1145\/3368926.3369724-13","doi-asserted-by":"crossref","unstructured":"Battiti, Roberto, and Alan A. Bertossi. \"Greedy, prohibition, and reactive heuristics for graph partitioning.\" IEEE Transactions on Computers 48.4 (1999): 361--385.","DOI":"10.1109\/12.762522"}],"event":{"name":"the Tenth International Symposium","location":"Hanoi, Ha Long Bay, Viet Nam","acronym":"SoICT 2019","number":"10","sponsor":["SOICT, School of Information and Communication Technology - HUST","NAFOSTED, The National Foundation for Science and Technology Development"],"start":{"date-parts":[[2019,12,4]]},"end":{"date-parts":[[2019,12,6]]}},"container-title":["Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368926.3369724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3369724&ftid=2101282&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:05Z","timestamp":1750204385000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3368926.3369724"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2019]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1145\/3368926.3369724","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}