乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T15:48:57Z","timestamp":1710517737012},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10586-023-03988-x","type":"journal-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T18:02:46Z","timestamp":1679594566000},"page":"875-891","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new distributed graph coloring algorithm for large graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Assia","family":"Brighen","sequence":"first","affiliation":[]},{"given":"Hachem","family":"Slimani","sequence":"additional","affiliation":[]},{"given":"Abdelmounaam","family":"Rezgui","sequence":"additional","affiliation":[]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,23]]},"reference":[{"key":"3988_CR1","doi-asserted-by":"publisher","unstructured":"Abbasian, R., Mouhoub, M.: An efficient hierarchical parallel genetic algorithm for graph coloring problem. In: GECCO\u201911 Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, pp. 521\u2013528 (2011). https:\/\/doi.org\/10.1145\/2001576.2001648","DOI":"10.1145\/2001576.2001648"},{"key":"3988_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2021.102769","volume":"106","author":"S Acer","year":"2021","unstructured":"Acer, S., Boman, E.G., Glusa, C.A., Rajamanickam, S.: Sphynx: a parallel multi-GPU graph partitioner for distributed-memory systems. Parallel Comput. 106, 102769 (2021). https:\/\/doi.org\/10.1016\/j.parco.2021.102769","journal-title":"Parallel Comput."},{"key":"3988_CR3","doi-asserted-by":"publisher","unstructured":"Adeogun, R., Berardinelli, G., Mogensen, P.: Learning to dynamically allocate radio resources in mobile 6g in-x subnetworks. In: 2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 959\u2013965 (2021). https:\/\/doi.org\/10.1109\/PIMRC50174.2021.9569345","DOI":"10.1109\/PIMRC50174.2021.9569345"},{"key":"3988_CR4","doi-asserted-by":"publisher","unstructured":"Alabandi, G., Powers, E., Burtscher, M.: Increasing the parallelism of graph coloring via shortcutting. In: PPoPP\u201920, Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 262\u2013275 (2020). https:\/\/doi.org\/10.1145\/3332466.3374519","DOI":"10.1145\/3332466.3374519"},{"issue":"Special Issue\u20131","key":"3988_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18201\/ijisae.273053","volume":"4","author":"M Aslan","year":"2016","unstructured":"Aslan, M., Baykan, N.A.: A performance comparison of graph coloring algorithms. Intell. Syst. Appl. Eng. 4(Special Issue\u20131), 1\u20137 (2016). https:\/\/doi.org\/10.18201\/ijisae.273053","journal-title":"Intell. Syst. Appl. Eng."},{"issue":"2","key":"3988_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C Avanthay","year":"2003","unstructured":"Avanthay, C., Hertz, A., Zufferey, N.: A variable neighborhood search for graph coloring. Eur. J. Oper. Res. 151(2), 379\u2013388 (2003). https:\/\/doi.org\/10.1016\/S0377-2217(02)00832-9","journal-title":"Eur. J. Oper. Res."},{"key":"3988_CR7","unstructured":"Avery, C.: Giraph: large-scale graph processing infrastructure on hadoop. In: Proceeding of the 2011 Hadoop Summit. Santa Clara (2011)"},{"issue":"1\u20134","key":"3988_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/B:ANOR.0000032574.01332.98","volume":"130","author":"N Barnier","year":"2004","unstructured":"Barnier, N., Brisset, P.: Graph coloring for air traffic flow management. Ann. Oper. Res. 130(1\u20134), 163\u2013178 (2004). https:\/\/doi.org\/10.1023\/B:ANOR.0000032574.01332.98","journal-title":"Ann. Oper. Res."},{"key":"3988_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.future.2018.10.045","volume":"94","author":"V Bhatia","year":"2019","unstructured":"Bhatia, V., Rani, R.: A distributed overlapping community detection model for large graphs using autoencoder. Futur. Gener. Comput. Syst. 94, 16\u201326 (2019). https:\/\/doi.org\/10.1016\/j.future.2018.10.045","journal-title":"Futur. Gener. Comput. Syst."},{"key":"3988_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2022.102896","volume":"110","author":"I Bogle","year":"2022","unstructured":"Bogle, I., Slota, G.M., Boman, E.G., Devine, K.D., Rajamanickam, S.: Parallel graph coloring algorithms for distributed GPU environments. Parallel Comput. 110, 102896 (2022). https:\/\/doi.org\/10.1016\/j.parco.2022.102896","journal-title":"Parallel Comput."},{"key":"3988_CR11","doi-asserted-by":"publisher","unstructured":"Boman, E.G., Bozdag, D., Catalyurek, U., Gebremedhin, A.H., Manne, F.: A scalable parallel graph coloring algorithm for distributed memory computers. In: Euro-Par\u201905 Proceedings of the 11th International Euro-Par Conference on Parallel Processing, pp. 241\u2013251 (2005). https:\/\/doi.org\/10.1007\/11549468_29","DOI":"10.1007\/11549468_29"},{"issue":"4","key":"3988_CR12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.jpdc.2007.08.002","volume":"68","author":"D Bozda\u011f","year":"2008","unstructured":"Bozda\u011f, D., Gebremedhin, A.H., Manne, F., Boman, E.G., Catalyurek, U.V.: A framework for scalable greedy coloring on distributed-memory parallel computers. J. Parallel Distrib. Comput. 68(4), 515\u2013535 (2008). https:\/\/doi.org\/10.1016\/j.jpdc.2007.08.002","journal-title":"J. Parallel Distrib. Comput."},{"key":"3988_CR13","doi-asserted-by":"publisher","unstructured":"Brighen, A., Slimani, H., Rezgui, A., Kheddouci, H.: A distributed large graph coloring algorithm on giraph. In: CloudTech\u201920, the 5th International Conference on Cloud Computing and Artificial Intelligence: Technologies and Applications, Marrakesh, Morocco, pp. 1\u20137. https:\/\/doi.org\/10.1109\/CloudTech49835.2020.9365872","DOI":"10.1109\/CloudTech49835.2020.9365872"},{"key":"3988_CR14","doi-asserted-by":"publisher","first-page":"4918","DOI":"10.1007\/s11227-019-02770-4","volume":"75","author":"A Brighen","year":"2019","unstructured":"Brighen, A., Slimani, H., Rezgui, A., Kheddouci, H.: Listing all maximal cliques in large graphs on vertex-centric model. J. Supercomput. 75, 4918\u20134946 (2019). https:\/\/doi.org\/10.1007\/s11227-019-02770-4","journal-title":"J. Supercomput."},{"key":"3988_CR15","doi-asserted-by":"publisher","unstructured":"Br\u00e91az, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979). https:\/\/doi.org\/10.1145\/359094.359101","DOI":"10.1145\/359094.359101"},{"key":"3988_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.parco.2019.04.005","volume":"86","author":"LAR Capelli","year":"2019","unstructured":"Capelli, L.A.R., Hu, Z., Zakian, T.A.K., Brown, N., Bull, J.M.: iPregel: Vertex-centric programmability vs memory efficiency and performance, why choose? Parallel Comput. 86, 45\u201356 (2019). https:\/\/doi.org\/10.1016\/j.parco.2019.04.005","journal-title":"Parallel Comput."},{"key":"3988_CR17","doi-asserted-by":"publisher","unstructured":"Chen, H., Zhou, P.: An ant algorithm for solving the four-coloring map problem. In: The Ninth International Conference on Natural Computation (ICNC), pp. 491\u2013495 (2013). https:\/\/doi.org\/10.1109\/ICNC.2013.6818026","DOI":"10.1109\/ICNC.2013.6818026"},{"key":"3988_CR18","doi-asserted-by":"publisher","unstructured":"Chen, W., Chen, W., Ashar, P., Chen, K., Cheng, B.: Register allocation for intel processor graphics. In: CGO 2018 Proceedings of the 2018 International Symposium on Code Generation and Optimization, pp. 352\u2013364 (2018). https:\/\/doi.org\/10.1145\/3168806","DOI":"10.1145\/3168806"},{"key":"3988_CR19","unstructured":"Ching, A.: Scaling apache giraph to a trillion edges. Facebook Engineering blog. http:\/\/www.facebook.com\/10151617006153920 (2013)"},{"issue":"1\u20133","key":"3988_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0166-218X(94)90207-0","volume":"49","author":"D de Werra","year":"1994","unstructured":"de Werra, D., Gay, Y.: Chromatic scheduling and frequency assignment. Discret. Appl. Math. 49(1\u20133), 165\u2013174 (1994). https:\/\/doi.org\/10.1016\/0166-218X(94)90207-0","journal-title":"Discret. Appl. Math."},{"key":"3988_CR21","doi-asserted-by":"publisher","unstructured":"Deveci, M., Boman, E.G., Devine, K.D., Rajamanickam, S.: Parallel graph coloring for manycore architectures. In: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, Chicago, IL, USA, pp. 892\u2013901 (2016). https:\/\/doi.org\/10.1109\/IPDPS.2016.54","DOI":"10.1109\/IPDPS.2016.54"},{"key":"3988_CR22","doi-asserted-by":"publisher","first-page":"2384","DOI":"10.1016\/j.cor.2005.09.010","volume":"34","author":"M Gamache","year":"2007","unstructured":"Gamache, M., Hertz, A., Ouellet, J.O.: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. Comput. Oper. Res. 34, 2384\u20132395 (2007). https:\/\/doi.org\/10.1016\/j.cor.2005.09.010","journal-title":"Comput. Oper. Res."},{"key":"3988_CR23","doi-asserted-by":"publisher","unstructured":"Gandhi, N.M., Misra, R.: Performance comparison of parallel graph coloring algorithms on bsp model using hadoop. In: 2015 International Conference on Computing, Networking and Communications (ICNC), CA, USA, pp. 110\u2013116 (2015). https:\/\/doi.org\/10.1109\/ICCNC.2015.7069325","DOI":"10.1109\/ICCNC.2015.7069325"},{"issue":"12","key":"3988_CR24","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1002\/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2","volume":"12","author":"AH Gebremedhin","year":"2000","unstructured":"Gebremedhin, A.H., Manne, F.: Scalable parallel graph coloring algorithms. Concurrency 12(12), 1131\u20131146 (2000)","journal-title":"Concurrency"},{"key":"3988_CR25","unstructured":"Giraph, A.: Apache giraph! https:\/\/giraph.apache.org"},{"issue":"2","key":"3988_CR26","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/jpdc.1996.0117","volume":"37","author":"JR Gjertsen","year":"1996","unstructured":"Gjertsen, J.R., Jones, M.T., Plassmann, P.E.: Parallel heuristics for improved, balanced graph colorings. J. Parallel Distrib. Comput. 37(2), 171\u2013186 (1996). https:\/\/doi.org\/10.1006\/jpdc.1996.0117","journal-title":"J. Parallel Distrib. Comput."},{"key":"3988_CR27","doi-asserted-by":"publisher","unstructured":"Goodarzi, B., Burtscher, M., Goswami, D.: Parallel graph partitioning on a CPU-GPU architecture. In: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Chicago, IL, USA, pp. 58\u201366 (2016). https:\/\/doi.org\/10.1109\/IPDPSW.2016.16","DOI":"10.1109\/IPDPSW.2016.16"},{"key":"3988_CR28","doi-asserted-by":"publisher","unstructured":"Grosset, A.V.P., Zhuand, P., Venkatasubramanian, S., Hall, M.: Evaluating graph coloring on GPUs. In: PPoPP\u201911 Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming, ACM SIGPLAN Notices-PPoPP\u201911, vol. 46(8), pp. 297\u2013298 (2011). https:\/\/doi.org\/10.1145\/2038037.1941597","DOI":"10.1145\/2038037.1941597"},{"key":"3988_CR29","doi-asserted-by":"publisher","unstructured":"Gwee, B.H., Lim, M.H., Ho, J.S.: Solving four-colouring map problem using genetic algorithm. In: The First New Zealand International Two-Stream Conference on Artificial Neural Networks and Expert Systems, pp. 332\u2013333 (1993). https:\/\/doi.org\/10.1109\/ANNES.1993.323010","DOI":"10.1109\/ANNES.1993.323010"},{"key":"3988_CR30","doi-asserted-by":"publisher","unstructured":"Hasenplaugh, W., Kaler, T., Schardl, T.B., Leiserson, C.E.: Ordering heuristics for parallel graph coloring. In: SPAA \u201914 Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 166\u2013177 (2014). https:\/\/doi.org\/10.1145\/2612669.2612697","DOI":"10.1145\/2612669.2612697"},{"key":"3988_CR31","doi-asserted-by":"publisher","unstructured":"Hendren, L.J., Gao, G.R., Altman, E.R., Mukerji, C.: A register allocation framework based on hierarchical cyclic interval graphs. In: International Conference on Compiler Construction, pp. 176\u2013191 (1992). https:\/\/doi.org\/10.1007\/3-540-55984-1_17","DOI":"10.1007\/3-540-55984-1_17"},{"issue":"2","key":"3988_CR32","doi-asserted-by":"publisher","first-page":"293","DOI":"10.2298\/YJOR130704039H","volume":"24","author":"A Hertz","year":"2014","unstructured":"Hertz, A., Ries, B.: A note on r-equitable k-colorings of trees. Yugoslav J. Oper. Res. 24(2), 293\u2013298 (2014). https:\/\/doi.org\/10.2298\/YJOR130704039H","journal-title":"Yugoslav J. Oper. Res."},{"key":"3988_CR33","doi-asserted-by":"publisher","unstructured":"H\u00e9brard, E., Katsirelos, G.: A hybrid approach for exact coloring of massive graphs. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019) (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_25","DOI":"10.1007\/978-3-030-19212-9_25"},{"issue":"1\u20133","key":"3988_CR34","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","volume":"91","author":"RW Irving","year":"1999","unstructured":"Irving, R.W., Manlove, D.F.: The b-chromatic number of a graph. Discret. Appl. Math. 91(1\u20133), 127\u2013141 (1999). https:\/\/doi.org\/10.1016\/S0166-218X(98)00146-2","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"3988_CR35","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1137\/0914041","volume":"14","author":"MT Jones","year":"1993","unstructured":"Jones, M.T., Plassmann, P.E.: A parallel graph coloring heuristic. SIAM J. Sci. Comput. 14(3), 654\u2013669 (1993). https:\/\/doi.org\/10.1137\/0914041","journal-title":"SIAM J. Sci. Comput."},{"key":"3988_CR36","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complex. Comput. Comput., 85\u2013103 (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"3988_CR37","doi-asserted-by":"crossref","unstructured":"Kosowski, A., Manuszewski, K.: Classical graph coloring. In: Kubale, M. (ed.) Graph Colorings, chapter 1, pp. 1\u201320. American Mathematical Society, Providence (2004)","DOI":"10.1090\/conm\/352\/06369"},{"key":"3988_CR38","unstructured":"Leskovec, J., Krevl, A.: Snap datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"3988_CR39","doi-asserted-by":"publisher","unstructured":"Liu, H.F., Su, C.T., Chu, A.C.: Fast quasi-biclique mining with giraph. In: BIGDATACONGRESS\u201913 Proceedings of the 2013 IEEE International Congress on Big Data, pp. 347\u2013354 (2013). https:\/\/doi.org\/10.1109\/BigData.Congress.2013.53","DOI":"10.1109\/BigData.Congress.2013.53"},{"key":"3988_CR40","doi-asserted-by":"publisher","unstructured":"Loveless, T., Ott, J., Brisk, P.: A performance-optimizing compiler for cyber-physical digital microfluidic biochips. In: CGO 2020, Proceedings of the 18th ACM\/IEEE International Symposium on Code Generation and Optimization, pp. 171\u2013184 (2020). https:\/\/doi.org\/10.1145\/3368826.3377925","DOI":"10.1145\/3368826.3377925"},{"issue":"4","key":"3988_CR41","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986). https:\/\/doi.org\/10.1137\/0215074","journal-title":"SIAM J. Comput."},{"key":"3988_CR42","doi-asserted-by":"publisher","unstructured":"Lunagariya, D.C., Somayajulu, D.V.L.N., Krishna, P.R.: Se-cda: A scalable and efficient community detection algorithm. In: 2014 IEEE International Conference on Big Data (Big Data), Washington, DC, USA, pp. 877\u2013882 (2014). https:\/\/doi.org\/10.1109\/BigData.2014.7004318","DOI":"10.1109\/BigData.2014.7004318"},{"key":"3988_CR43","doi-asserted-by":"publisher","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, Indiana, USA, pp. 135\u2013146 (2010). https:\/\/doi.org\/10.1145\/1807167.1807184","DOI":"10.1145\/1807167.1807184"},{"key":"3988_CR44","doi-asserted-by":"publisher","unstructured":"Patidar, H., Chakrabarti, P.: A tree-based graph coloring algorithm using independent set. In: Progress in Advanced Computing and Intelligent Engineering, pp. 537\u2013546 (2019). https:\/\/doi.org\/10.1007\/978-981-13-0224-4_48","DOI":"10.1007\/978-981-13-0224-4_48"},{"key":"3988_CR45","doi-asserted-by":"publisher","unstructured":"Peng, Y., Choi, B., He, B., Zhou, S., Xu, R., Yu, X.: Vcolor: A practical vertex-cut based approach for coloring large graphs. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 97\u2013108 (2016). https:\/\/doi.org\/10.1109\/ICDE.2016.7498232","DOI":"10.1109\/ICDE.2016.7498232"},{"key":"3988_CR46","doi-asserted-by":"publisher","unstructured":"Rahman, M.S.: Basic Graph Theory. Springer International Publishing, 1 edn (2017). https:\/\/doi.org\/10.1007\/978-3-319-49475-3","DOI":"10.1007\/978-3-319-49475-3"},{"key":"3988_CR47","doi-asserted-by":"publisher","unstructured":"Rai, D., Chaudhari, N.S., Ingle, M.: An efficient algorithmic 3-sat formulation for sudoku puzzle using graph coloring. In: 2018 International Conference on Advanced Computation and Telecommunication (ICACAT), Bhopal, India, pp. 1\u20136 (2018). https:\/\/doi.org\/10.1109\/ICACAT.2018.8933664","DOI":"10.1109\/ICACAT.2018.8933664"},{"key":"3988_CR48","doi-asserted-by":"publisher","unstructured":"Rajan, A.K., Bhaiya, D.: Accelerated kerninghan lin algorithm for graph partitioning. In: 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI), Udupi, India, pp. 58\u201366 (2017). https:\/\/doi.org\/10.1109\/ICACCI.2017.8125836","DOI":"10.1109\/ICACCI.2017.8125836"},{"issue":"4","key":"3988_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.9790\/9622-1004050105","volume":"10","author":"T Ramachandran","year":"2020","unstructured":"Ramachandran, T., Deepika, N.: Vertex coloring of graph using adjacency matrix. J. Eng. Resh Appl. 10(4), 1\u20135 (2020). https:\/\/doi.org\/10.9790\/9622-1004050105","journal-title":"J. Eng. Resh Appl."},{"key":"3988_CR50","doi-asserted-by":"publisher","unstructured":"Riihijarvi, J., Petrova, M., Mahonen, P.: Frequency allocation for wlans using graph colouring techniques. In: Second Annual Conference on Wireless On-demand Network Systems and Services, pp. 216\u2013222 (2005). https:\/\/doi.org\/10.1109\/WONS.2005.19","DOI":"10.1109\/WONS.2005.19"},{"issue":"1","key":"3988_CR51","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TCSS.2017.2762430","volume":"5","author":"S Roy","year":"2018","unstructured":"Roy, S., Dey, P., Kundu, D.: Social network analysis of cricket community using a composite distributed framework: From implementation viewpoint. EEE Trans. Comput. Soc. Syst. 5(1), 64\u201381 (2018). https:\/\/doi.org\/10.1109\/TCSS.2017.2762430","journal-title":"EEE Trans. Comput. Soc. Syst."},{"key":"3988_CR52","doi-asserted-by":"publisher","unstructured":"Sakr, S., Orakzai, F.M., Abdelaziz, I., Khayyat, Z.: Large-Scale Graph Processing Using Apache Giraph, 1 edn. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-319-47431-1","DOI":"10.1007\/978-3-319-47431-1"},{"key":"3988_CR53","doi-asserted-by":"publisher","unstructured":"Sakr, S., Orakzai, F.M., Abdelaziz, I., Khayyat, Z.: Large-Scale Graph Processing Using Apache Giraph. Springer International Publishing (2016). https:\/\/doi.org\/10.1007\/978-3-319-49475-3","DOI":"10.1007\/978-3-319-49475-3"},{"key":"3988_CR54","doi-asserted-by":"publisher","unstructured":"Schuetz, M.J.A., Brubaker, J.K., Zhu, Z., Katzgraber, H.G.: Graph coloring with physics-inspired graph neural networks. arXiv:2202.01606 (2022). https:\/\/doi.org\/10.48550\/arXiv.2202.01606","DOI":"10.48550\/arXiv.2202.01606"},{"key":"3988_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2020.101863","volume":"94","author":"M Shafiq","year":"2020","unstructured":"Shafiq, M., Tian, Z., Sun, Y., Du, X., Guizani, M.: IoT malicious traffic identification using wrapper-based feature selection mechanisms. Comput. Secur. 94, 101863 (2020). https:\/\/doi.org\/10.1016\/j.cose.2020.101863","journal-title":"Comput. Secur."},{"key":"3988_CR56","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.future.2020.02.017","volume":"107","author":"M Shafiq","year":"2020","unstructured":"Shafiq, M., Tian, Z., Sun, Y., Du, X., Guizani, M.: Selection of effective machine learning algorithm and Bot-IoT attacks traffic identification for internet of things in smart city. Futur. Gener. Comput. Syst. 107, 433\u2013442 (2020). https:\/\/doi.org\/10.1016\/j.future.2020.02.017","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"5","key":"3988_CR57","doi-asserted-by":"publisher","first-page":"3242","DOI":"10.1109\/JIOT.2020.3002255","volume":"8","author":"M Shafiq","year":"2021","unstructured":"Shafiq, M., Tian, Z., Bashir, A.K., Du, X., Guizani, M.: CorrAUC: a malicious Bot-IoT traffic detection method in IoT network using machine-learning techniques. IEEE Internet Things J. 8(5), 3242\u20133254 (2021). https:\/\/doi.org\/10.1109\/JIOT.2020.3002255","journal-title":"IEEE Internet Things J."},{"key":"3988_CR58","doi-asserted-by":"publisher","unstructured":"Shao, Y., Chen, L., Cui, B.: Efficient cohesive subgraphs detection in parallel. In: SIGMOD\u201914 Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data , Utah, USA, pp. 613\u2013624 (2014). https:\/\/doi.org\/10.1145\/2588555.2593665","DOI":"10.1145\/2588555.2593665"},{"issue":"9","key":"3988_CR59","doi-asserted-by":"publisher","first-page":"9926","DOI":"10.1609\/aaai.v36i9.21230","volume":"36","author":"Y Shen","year":"2022","unstructured":"Shen, Y., Sun, Y., Li, X., Eberhard, A., Ernst, A.: Enhancing column generation by a machine-learning-based pricing heuristic for graph coloring. Proc. AAAI Confer. Artific. Intell. 36(9), 9926\u20139934 (2022). https:\/\/doi.org\/10.1609\/aaai.v36i9.21230","journal-title":"Proc. AAAI Confer. Artific. Intell."},{"key":"3988_CR60","doi-asserted-by":"crossref","unstructured":"Shukla, A.N., Garg, M.L., Misra, R.: An approach to solve graph coloring problem using linked list. Int. J. Adv. Stud. Sci. Res., 4(2) (2019)","DOI":"10.21786\/bbrc\/12.2\/33"},{"issue":"1","key":"3988_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13638-020-01882-3","volume":"2021","author":"Z Si","year":"2021","unstructured":"Si, Z., Chuai, G., Gao, W., Zhang, J., Chen, X., Zhang, K.: A QoS-based joint user association and resource allocation scheme in ultra-dense networks. EURASIP J. Wirel. Commun. Netw. 2021(1), 1\u201324 (2021). https:\/\/doi.org\/10.1186\/s13638-020-01882-3","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"3988_CR62","doi-asserted-by":"publisher","unstructured":"Ait Taleb, S., Slimani, H., Khanouche, M.E.: A routing approach based on (N, p)-equitable b-coloring of graphs for wireless sensor networks. In: 2018 International Conference on Smart Communications in Network Technologies (SaCoNeT), pp. 90\u201395 (2018). https:\/\/doi.org\/10.1109\/SaCoNeT.2018.8585585","DOI":"10.1109\/SaCoNeT.2018.8585585"},{"key":"3988_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2017.09.004","volume":"235","author":"S Ait Taleb","year":"2018","unstructured":"Ait Taleb, S., Slimani, H., Kheddouci, H.: (n, p)-equitable b-coloring of graphs. Discret. Appl. Math. 235, 1\u20135 (2018). https:\/\/doi.org\/10.1016\/j.dam.2017.09.004","journal-title":"Discret. Appl. Math."},{"key":"3988_CR64","doi-asserted-by":"publisher","unstructured":"Tziritas, N., Loukopoulos, T., Khan, S.U., Xu, C., Zomaya, A.Y.: A communication-aware energy-efficient graph coloring algorithm for vm placement in clouds. In: 2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld\/SCALCOM\/UIC\/ATC\/CBDCom\/IOP\/SCI), pp. 1684\u20131691 (2018). https:\/\/doi.org\/10.1109\/SmartWorld.2018.00286","DOI":"10.1109\/SmartWorld.2018.00286"},{"issue":"8","key":"3988_CR65","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990). https:\/\/doi.org\/10.1145\/79173.79181","journal-title":"Commun. ACM"},{"issue":"6","key":"3988_CR66","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1070\/RM1968v023n06ABEH001252","volume":"23","author":"VG Vizing","year":"1968","unstructured":"Vizing, V.G.: Some unsolved problems in graph theory. Russ. Math. Surv. 23(6), 125\u2013141 (1968). https:\/\/doi.org\/10.1070\/RM1968v023n06ABEH001252","journal-title":"Russ. Math. Surv."},{"issue":"1","key":"3988_CR67","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJA Welsh","year":"1967","unstructured":"Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10(1), 85\u201386 (1967). https:\/\/doi.org\/10.1093\/comjnl\/10.1.85","journal-title":"Comput. J."},{"key":"3988_CR68","doi-asserted-by":"publisher","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J., Stoica, I.: Graphx: a resilient distributed graph system on spark. In: GRADES\u201913 First International Workshop on Graph Data Management Experiences and Systems, Article No. 2 (2013). https:\/\/doi.org\/10.1145\/2484425.2484427","DOI":"10.1145\/2484425.2484427"},{"key":"3988_CR69","doi-asserted-by":"publisher","unstructured":"Yadav, J.R., Somayajulu, D.V.L.N., Krishna, P.R.: A scalable algorithm for discovering topologies in social networks. In: 2014 IEEE International Conference on Data Mining Workshop, Shenzhen, China, pp. 818\u2013827 (2014). https:\/\/doi.org\/10.1109\/ICDMW.2014.75","DOI":"10.1109\/ICDMW.2014.75"},{"key":"3988_CR70","doi-asserted-by":"publisher","unstructured":"Zhaocai, W., Dangweia, W., Xiaoguangb, B., Tunhua, W.: A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity. Journal of Intelligent & Fuzzy Systems, pages 1\u201311, (2021). https:\/\/doi.org\/10.3233\/JIFS-200025","DOI":"10.3233\/JIFS-200025"},{"issue":"1","key":"3988_CR71","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/TPDS.2020.3014173","volume":"32","author":"Z Zheng","year":"2020","unstructured":"Zheng, Z., Shi, X., He, L., Jin, H., Wei, S., Dai, H., Peng, X.: Feluca: a two-stage graph coloring algorithm with color-centric paradigm on GPU. IEEE Trans. Parallel Distrib. Syst. 32(1), 160\u2013173 (2020). https:\/\/doi.org\/10.1109\/TPDS.2020.3014173","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-023-03988-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-023-03988-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-023-03988-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T16:19:54Z","timestamp":1708791594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-023-03988-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,23]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["3988"],"URL":"https:\/\/doi.org\/10.1007\/s10586-023-03988-x","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,23]]},"assertion":[{"value":"28 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Ethical approval is not applicable, because this article does not contain any studies with human or animal subjects.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}