A Genetic Algorithm for Large Graph Partitioning Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Genetic Algorithm for Large Graph Partitioning Problem

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Tenth International Symposium on Information and Communication Technology - SoICT 2019
language:
Short-container-title:

Author:

Nguyen Xuan-Tung¹,Cao Phuong-Nam¹,Nguyen Van-Quyet²,Kim Kyungbaek³,Huynh Quyet-Thang¹

Affiliation:

1. Software Engineering, Hanoi University of Science and Technology, Ha Noi, Vietnam

2. Information Technology, Hung Yen University Technology and Education, Hung Yen, Vietnam

3. Electronics and Computer Engineering, Chonnam National University, Gwangju, Korea

Publisher

ACM Press

Reference13 articles.

1. 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.

2. 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.

3. 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

4. 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.

5. 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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3